Re: HSC 2015 3U Marathon
Can someone do this I still can't do it:
-------
What is important to grasp here is what was my motivation for starting from k(k+2) < (k+1)^2
It wasn't something coming from thin air, all I did was ask:
"ok, I need to get from the assumption, to the inductive step inequality, how can I transform the assumption inequality to get the lower bound of the assumption"
well, I got this:
Then by doing this, I ask myself the question
"Now, I need to ask, is this new upper bound, lower than the upper bound of the inductive step, if so, then the problem is complete" (*)
That is, I then need to ask whether:
is true, and it turns out it is with a bit of simplification of powers.
---------
(Note, this 'method' is simply a heuristic for problem solving, for SOME problems, asking the question (*) is not always helpful)