Number theoryDifficulty 6.8National olympiadFind the answer
For positive reals p and q, define the remainder when p and 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
1. Define the remainders r1 and r2 as follows: r1=a2+b3−k12 where k1 is an integer such that 0≤a2+b3−k12<2. Simplifying, we get: r1=b3−(k1−a)2 Similarly, for r2: r2=a2+b3−k23 where k2 is an integer such that 0≤a2+b3−k23<3. Simplifying, we get: r2=a2−(k2−b)3
2. Given that r1+r2=2, we substitute the expressions for r1 and r2: b3−(k1−a)2+a2−(k2−b)3=2 Simplifying, we get: b3−k12+a2−k23+a2+b3=2 2b3+2a2−k12−k23=2
3. To satisfy the condition r1+r2=2, we need: b3−(a−1)2=b3−a2+2<2 and 0≤a2−b3<3
4. Combining these conditions, we get: 0<a2−b3≤2
5. For each b, there exists exactly one value of a such that the inequality holds. We need to find the number of b such that there exists an a≤20.
6. We need to check the range of b for which a≤20. Since a and b are positive integers, we need to find the number of b such that: 0<a2−b3≤2 This implies: b3<a2≤b3+2
7. For a≤20, we need to find the number of b such that: b3<202 Simplifying, we get: b<3202≈16.33
8. Therefore, b can take integer values from 1 to 16. For each b, there is exactly one a such that a≤20.
The final answer is 16.
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.