need help with two questions:
prove with inducation that for every natural n exists:
For the 1st one....
If the inequality is valid, then we try to use it to prove the following
As this is then we only need ask if
Now, since |a|<1
Therefore, the extra terms sum to a negative value
and the overall sum is at least 2.
Now prove for the first term
For the 2nd one..
If this is true, then the following must be true
We try to use the first statement to prove the second one..
Since these denominators are larger than those in (1),
then these fractions are even smaller than those in (1)
Hence, the inductive step is proven,
meaning that if the inequality holds for any n=k, it holds for the next n=k+1 and the next n=k+2 and the next n=k+3 etc etc,
therefore it only needs to be validated for an initial term.