Number theoryDifficulty 6.0Prove itUkrainian National Mathematical Olympiad · Ukraine
After x matches in a championship a team had exactly n% of wins, where x,n are positive integers. What is the least x for which it is possible that after x+1-st match the team had exactly (n+1)% of wins?
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.
It follows from the conditions of the problem that after x matches the team had y wins, such that xy=100n. Then, the following has to hold: x+1y+1=100n+1.
The first equation implies 100y=nx, and so 100 has to divide nx. The second equation implies 100y+100=nx+x+n+1⇒100=x+n+1. Hence x=100−n−1≤98. Moreover, n=100−x−1⇒xn=100x−x2−x. Therefore, 100 has to divide x2+x. Since x2+x=x(x+1) and the numbers x and x+1 are relatively prime and less than 100, one of the numbers has to be divisible by 4, and the other by 25. Clearly, the smallest such number is x=24. Thus, n=75 and y=18. It is easy to check that xy=2418=75% and x+1y+1=2519=76%
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.