Maths Olympiad Prep

Library / /74 of 196

Number theory Difficulty 4.9 AIME Prove it Soviet Union

Problem:
Find the smallest positive integer which can be represented as 36m5n36^{m} - 5^{n}.

Solution

Solution:
Obviously 11=3615211 = 36^{1} - 5^{2}, and we guess that this is the best possible. We cannot have 36m5n=k36^{m} - 5^{n} = k, where 22, 33 or 55 divides kk (because then 22 would divide 5n5^{n} and similarly in the other cases). So the only possible values of k<11k < 11 are 11, 77.
We have 36m5n=1(mod5)36^{m} - 5^{n} = 1 \pmod{5}, so k7k \neq 7. Similarly, 36m5n=3(mod4)36^{m} - 5^{n} = 3 \pmod{4}, so k1k \neq 1.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

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