Problem 7: Chain of equations () 1997 Paper II
Suppose that
Guess an expression, in terms of , for . Then, by induction or otherwise, prove the correctness of your guess.
Comments
Wording this sort of question is a real headache for the examiners. Suppose you guess wrong; how can you then prove your guess by induction (unless you get that wrong too)? How else can the question be phrased? In the end, we decided to assume that you are all so clever that your guesses will all be correct.
To guess the formula, you need to work out , , , etc and look for a pattern. You should not need to go beyond .
Proof by induction is not in the core A-level syllabus. We decided to include it in the syllabus for STEP I and II because the idea behind it is not difficult and it is very important both as a method of proof and also as an introduction to more sophisticated mathematical thought.
Solution to problem 7
First let’s put the equations into a more manageable form. Each equality can be written in the form
We find , , and . The denominators give the game away. We guess
For the induction, we need a starting point: our guess certainly holds for (and 2, 3, and 4!).
For the inductive step, we suppose our guess also holds for , where is any integer, so that
If we can show that it then also holds for , we are done.
We have, from the equation given in the question,
as required.
Post-mortem
There’s not much to say about this. By STEP standards, it is fairly easy and short. Nevertheless, you are left to your own devices from the beginning, so you should be pleased if you got it out.
Perhaps the key step came in the very first line of the solution, when we had to decide how to separate out the equations. We could have tried instead
leading to
and so on, but it would not be at all clear what to do next.