For positive reals p and q, define the remainder when p is divided by q as the smallest nonnegative real r such that qp−r is an integer. For an ordered pair (a,b) of positive integers, let r1 and r2 be the remainder when a2+b3 is divided by 2 and 3 respectively. Find the number of pairs (a,b) such that a,b≤20 and r1+r2=2.
A number or a short expression. Spacing and $ signs are ignored.
Solution
The remainder when we divide a2+b3 by 2 is defined to be the smallest non-negative real r1 such that 2a2+b3−r1 is integral. As 2x is integral iff x is an integral multiple of 2, it follows that r1=b3−c2, for some integer c. Furthermore given any real r such that 2a2+b3−r is integral, we may add or subtract 2 to r and the fraction remains an integer. Thus, the smallest non-negative real r1 such that the fraction is an integer must satisfy 0≤r1<2. Similarly, we find r2=a2−d3 for some integer d and 0≤r2<3. Since r1+r2=2, then (a−c)2+(b−d)3=2⟺a−c=1 and b−d=0 Finally, substituting in c=a−1 and d=b plugging back into our bounds for r1 and r2, we get {0≤b3−(a−1)2<20≤a2−b3<3 or ⎩⎨⎧(a−1)2≤b3b3<a2b3≤a2a2<(b+1)3 Note that b3<a2⟹b3≤a2 and (a−1)2≤b3⟹a2≤b3+2<b3+3=(b+1)3 so the last two inequalities are redundant. We are left with (a−1)2≤b3<a2 Since the non-negative number line is partitioned by intervals of the form [(a−1)2,a2) for positive integers a, for any positive integer b, we can find a positive integer a that satisfies the inequalities. As clearly a>b, it remains to find the number of b such that a≤20. This is bounded by b3<a2≤202⟺b<3202⟹b≤16 so there are 16 values of b and thus 16 ordered pairs of positive integers (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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.