Maths Olympiad Prep

Track / Stage 6 / 355 of 400 #1835 of 2444

Problem 1835

National Olympiad, first round
Number theory Difficulty 6.8 Prove it Slovenian Mathematical Olympiad · Slovenia · 2008

Maja can write positive integers onto a blackboard according to two rules. For every number nn that is already on the board, she can write down 3n+133n+13. Whenever one of the numbers on the board is a perfect square, she can also write down its square root.

a. Using only this two rules, can she get the number 5555 assuming she starts with 256256?

b. Using only this two rules, can she get the number 256256 assuming she starts with 5555?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

a. With 256256 written on the board, Maja can get 5555 by taking the square root of 256256, obtaining 1616, and then writing down 316+13=613 \cdot 16 + 13 = 61 and 361+13=1963 \cdot 61 + 13 = 196. Now, she can write down the square root of 196196, which is 1414, and finally she can get 5555 as 314+13=553 \cdot 14 + 13 = 55. (Note: there might be other ways of obtaining 5555, but this is the only one that requires less than 100100 steps).

b. Let us now show that Maja cannot get 256256 from 5555. Consider the remainders modulo 44. An even number is of the form 2k2k and its square is 4k24k^2. An odd number can be written as 2k+12k + 1, so its square is equal to 4k2+4k+14k^2 + 4k + 1, giving the remainder of 11 when divided by 44. We see that a perfect square can only give the remainders 00 or 11 when divided by 44, so we can never use the rule nnn \mapsto \sqrt{n} on numbers that give the remainder 22 or 33.

The remainder we get when dividing 5555 by 44 is 33. Using the rule n3n+13n \to 3n+13 on a number of the form 4k+34k+3, we get 12k+9+13=4(3k+5)+212k+9+13 = 4(3k+5)+2, a number that gives the remainder of 22. Using this rule on the number of the form 4k+24k+2, we get 12k+6+13=4(3k+4)+312k+6+13 = 4(3k+4)+3, the remainder is 33. After one step the remainder will be 22, then 33, then 22 again, and so on. Since 256256 is divisible by 44, Maja can never reach it using the given two rules.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.