Maths Olympiad Prep

Library / /48 of 264

Number theory Difficulty 5.1 AIME, harder Prove it Romania

a) Find all pairs of positive integers (m,n)(m, n), with mnm \le n, for which
p(2m+1)p(2n+1)=400. p(2m + 1) \cdot p(2n + 1) = 400.

Solution

a) Since 400=1400=4100=1625400 = 1 \cdot 400 = 4 \cdot 100 = 16 \cdot 25, we analyze three cases.
If p(2m+1)=1p(2m+1) = 1, p(2n+1)=400p(2n+1) = 400, we obtain 12m+1<41 \le 2m+1 < 4 and 4002n+1<441400 \le 2n+1 < 441, hence m{1,2}m \in \{1, 2\} and n{200,201,,219}n \in \{200, 201, \dots, 219\}, giving 40 pairs (m,n)(m, n). Similarly, in the second case we obtain 20 pairs, and in the last case, 24 pairs, leading to a total of 84 pairs.

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.