1988 Question 6.
Last Update
In 1988's International Mathematical Olympiad following question was number six (little bit edited): Let such that divides . Show that such that .
I come a cross this probelm in the ending of Numberphile's video. Video was about proof by induction and the ending claimed Professor Zvezdelina Stankova was able to proof question 6 via induction. This problem inquired me. Since her explanation of the proof was avaible, I decided not to watch the video and try my own hand on the proof first. After that, I probably contrast it with her explanation.
First, been in is rather large. Since squares of negative numbers is same as the square of negative of that negative number, we can just consider .
To determent variables for induction and the base case, let's play around. Following table summarizes the tests:
Equation | ||
---|---|---|
does not divide . | ||
does not divide . | ||
does not divide . | ||
does not divide . | ||
does not divide . | ||
does not divide . | ||
does not divide . | ||
where | does not divide . | |
where | does not divide . | |
where | does not divide . |
NEEDS TO BE RETHOUGHT FROM HERE.
It appears that statement is true because pair is only valid pair. Base case to verify this is our last test in the table. It proofs that every pair and additionally with symmetry every pair , where , does not have divading .
The induction hypothesis is:
The induction step for is: SECOND TRY!!!!