Number theoryDifficulty 4.9AIMEProve itSoviet Union
Problem: Find the smallest positive integer which can be represented as 36m−5n.
Solution
Solution: Obviously 11=361−52, and we guess that this is the best possible. We cannot have 36m−5n=k, where 2, 3 or 5 divides k (because then 2 would divide 5n and similarly in the other cases). So the only possible values of k<11 are 1, 7. We have 36m−5n=1(mod5), so k=7. Similarly, 36m−5n=3(mod4), so k=1.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.