Maths Olympiad Prep

Library / /1219 of 1394

, 2019

Algebra Difficulty 5.8 AIME, harder Find the answer United States

Problem:

For positive reals pp and qq, define the remainder when pp is divided by qq as the smallest nonnegative real rr such that prq\frac{p-r}{q} is an integer. For an ordered pair (a,b)(a, b) of positive integers, let r1r_{1} and r2r_{2} be the remainder when a2+b3a \sqrt{2}+b \sqrt{3} is divided by 2\sqrt{2} and 3\sqrt{3} respectively. Find the number of pairs (a,b)(a, b) such that a,b20a, b \leq 20 and r1+r2=2r_{1}+r_{2}=\sqrt{2}.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

The remainder when we divide a2+b3a \sqrt{2}+b \sqrt{3} by 2\sqrt{2} is defined to be the smallest non-negative real r1r_{1} such that a2+b3r12\frac{a \sqrt{2}+b \sqrt{3}-r_{1}}{\sqrt{2}} is integral. As x2\frac{x}{\sqrt{2}} is integral iff xx is an integral multiple of 2\sqrt{2}, it follows that r1=b3c2r_{1}=b \sqrt{3}-c \sqrt{2}, for some integer cc. Furthermore given any real rr such that a2+b3r2\frac{a \sqrt{2}+b \sqrt{3}-r}{\sqrt{2}} is integral, we may add or subtract 2\sqrt{2} to rr and the fraction remains an integer. Thus, the smallest non-negative real r1r_{1} such that the fraction is an integer must satisfy 0r1<20 \leq r_{1}<\sqrt{2}.
Similarly, we find r2=a2d3r_{2}=a \sqrt{2}-d \sqrt{3} for some integer dd and 0r2<30 \leq r_{2}<\sqrt{3}. Since r1+r2=2r_{1}+r_{2}=\sqrt{2}, then
(ac)2+(bd)3=2ac=1 and bd=0 (a-c) \sqrt{2}+(b-d) \sqrt{3}=\sqrt{2} \Longleftrightarrow a-c=1 \text{ and } b-d=0
Finally, substituting in c=a1c=a-1 and d=bd=b plugging back into our bounds for r1r_{1} and r2r_{2}, we get
{0b3(a1)2<20a2b3<3 \left\{\begin{array}{l} 0 \leq b \sqrt{3}-(a-1) \sqrt{2}<\sqrt{2} \\ 0 \leq a \sqrt{2}-b \sqrt{3}<\sqrt{3} \end{array}\right.
or
{(a1)2b3b3<a2b3a2a2<(b+1)3 \left\{\begin{array}{l} (a-1) \sqrt{2} \leq b \sqrt{3} \\ b \sqrt{3}<a \sqrt{2} \\ b \sqrt{3} \leq a \sqrt{2} \\ a \sqrt{2}<(b+1) \sqrt{3} \end{array}\right.
Note that b3<a2b3a2b \sqrt{3}<a \sqrt{2} \Longrightarrow b \sqrt{3} \leq a \sqrt{2} and
(a1)2b3a2b3+2<b3+3=(b+1)3 (a-1) \sqrt{2} \leq b \sqrt{3} \Longrightarrow a \sqrt{2} \leq b \sqrt{3}+\sqrt{2}<b \sqrt{3}+\sqrt{3}=(b+1) \sqrt{3}
so the last two inequalities are redundant. We are left with
(a1)2b3<a2 (a-1) \sqrt{2} \leq b \sqrt{3}<a \sqrt{2}
Since the non-negative number line is partitioned by intervals of the form [(a1)2,a2)[(a-1) \sqrt{2}, a \sqrt{2}) for positive integers aa, for any positive integer bb, we can find a positive integer aa that satisfies the inequalities. As clearly a>ba>b, it remains to find the number of bb such that a20a \leq 20. This is bounded by
b3<a2202b<2023b16 b \sqrt{3}<a \sqrt{2} \leq 20 \sqrt{2} \Longleftrightarrow b<\frac{20 \sqrt{2}}{\sqrt{3}} \Longrightarrow b \leq 16
so there are 16 values of bb and thus 16 ordered pairs of positive integers (a,b)(a, b) that satisfy the problem.

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.