I'm on my iPhone ATM, but question 3 should be
Done using sum of rectangles under curve and using
The bigger and lower rectangles to bound it. I'll show
You later if someone else doesn't
But if you had to do it using induction it is easiest
to separate the inequality and do induction twice
and then conclude that inequality
I'll go straight to the inductive proof step for the LHS of the inequality
First we establish a result as follows
Now to the induction step
Hence we can claim that
However, the result holds for n = 1 as an equality and so subsequent integers of n will lead to strict inequality, hence the result as a weak inequality is true by induction i.e.