Maths Olympiad Prep

Library / /486 of 520

Number theory Difficulty 7.3 National olympiad, round 2 Prove it

30 Let mm be a positive integer, and m2(mod4)m \equiv 2(\bmod 4). Prove: there exists at most one pair of positive integers (a,b)(a, b), such that m=abm=a b, and 0<ab<5+44m+10<a-b<\sqrt{5+4 \sqrt{4 m+1}}.

Solution

39. If the value of a+ba+b can be determined (considering mm as a constant), then by the inverse of Vieta's theorem, there is at most one pair of positive integers (a,b)(a, b) that satisfies the condition.

From the condition, we know that (a+b)2=(ab)2+4ab(a+b)^{2}=(a-b)^{2}+4 a b satisfies
1+4m(a+b)2<5+44m+1+4m=(4m+1+2)2\begin{aligned} 1+4 m & \leqslant(a+b)^{2} \\ & <5+4 \sqrt{4 m+1}+4 m \\ & =(\sqrt{4 m+1}+2)^{2} \end{aligned}

Thus,
4m+1a+b<4m+1+2\sqrt{4 m+1} \leqslant a+b<\sqrt{4 m+1}+2

Therefore,
a+b={4m+1 or 4m+1+1, if 4m+1 is an integer; [4m+1]+1 or [4m+1]+2, if 4m+1 is not an integer. a+b=\left\{\begin{array}{l} \sqrt{4 m+1} \text { or } \sqrt{4 m+1}+1, \text { if } \sqrt{4 m+1} \text { is an integer; } \\ {[\sqrt{4 m+1}]+1 \text { or }[\sqrt{4 m+1}]+2, \text { if } \sqrt{4 m+1} \text { is not an integer. }} \end{array}\right.

In summary, a+ba+b can only take values from two consecutive positive integers. Since ab=m2(mod4)a b=m \equiv 2(\bmod 4), it follows that aa and bb are one odd and one even, meaning a+ba+b is odd. This way, we know that the value of a+ba+b is uniquely determined, and the proposition is proved.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.