So I have a question. This isn't a particularly hard proof.
I had previously proved that:
So i'm allowed to use that. Not allowed to use derivatives/graphs either.
Now the question is can anyone prove this more efficiently than triple induction.
my first induction statement obviously is I base cased out 1, and 2, then I assumed it was true for all n > 2.
the second induction statement became for n > 2.
the third induction statement became and since I n >2 for the above 2, n > 2 for this as well.
I was wondering if anyone can do this faster than 3 inductions.