Maths Olympiad Prep

Track / Stage 7 / 123 of 300 #2003 of 2444

Problem 2003

National Olympiad second round; IMO P1/P4
Number theory Difficulty 7.4 Prove it Dutch Mathematical Olympiad · Netherlands

Two positive integers having difference 2020 are multiplied with each other; then 2323 is added to the result.

a. What is the smallest possible outcome that ends in 2323? *Give this outcome (and the two corresponding integers with difference 2020) and prove that no smaller outcome is possible.*

b. Is it possible that the result is the square of an integer? Give an example (and show that it is an example) or prove that this is impossible.

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. Suppose the two positive integers are n10n-10 and n+10n+10, and hence n>10n > 10. Then the product is equal to (n10)(n+10)=n2100(n-10)(n+10) = n^2 - 100 and we are looking for an n>10n > 10 such that n2100+23n^2 - 100 + 23 ends in the digits 2323. But that means we want n2n^2 to end in the digits 0000. In other words, we want n2n^2 to be divisible by 100100 and thus nn to be divisible by 1010. The smallest possible solution is n=20n=20 and we see that 1030+23=32310 \cdot 30 + 23 = 323 does indeed end at 2323. So the smallest possible outcome is 323323.

b. We take again the integers n10n-10 and n+10n+10. Now we need to find, for a certain integer kk, a solution for n2100+23=k2n^2 - 100 + 23 = k^2, or n2=k2+77n^2 = k^2 + 77. The difference between two consecutive squares is an odd number that becomes 22 bigger every time. We have that 1202=11^2 - 0^2 = 1, 2212=32^2 - 1^2 = 3, 3222=53^2 - 2^2 = 5, etcetera. In general: (m+1)2m2=2m+1(m+1)^2 - m^2 = 2m+1. We can get 7777 by taking m=762=38m = \frac{76}{2} = 38 and so k=38k = 38 and n=39n = 39. We see that indeed it holds that 2949+23=1444=38229 \cdot 49 + 23 = 1444 = 38^2. So it turns out to be possible that the result is a square. In fact, it turns out that this solution is unique, but the problem did not ask us to prove that.

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