1.Prove by induction that .
Show that is LESSER than for all positive integer values of n.
Deduce from these results that is LESSER than .
i can do the first part of the question. i need help for the second and third parts in getting started.
1.Prove by induction that .
Show that is LESSER than for all positive integer values of n.
Deduce from these results that is LESSER than .
i can do the first part of the question. i need help for the second and third parts in getting started.
The third part involves showing that
The induction proof appears more challenging than parts 2 and 3.
Here's how I would give the Induction Proof....
P(k)
P(k+1)
Try to prove that P(k) being true causes P(k+1) to also be true.
Proof
if P(k) is true.
This gives
Then test your initial value to complete the proof.