Maths Olympiad Prep

Library / /327 of 348

Algebra Difficulty 5.2 AIME, harder Find the answer

Determine the number of quadratic polynomials P(x)=p1x2+p2xp3P(x)=p_{1} x^{2}+p_{2} x-p_{3}, where p1,p2,p3p_{1}, p_{2}, p_{3} are not necessarily distinct (positive) prime numbers less than 50, whose roots are distinct rational numbers.

A number or a short expression. Spacing and $ signs are ignored.

Solution

The existence of distinct rational roots means that the given quadratic splits into linear factors. Then, since p1,p3p_{1}, p_{3} are both prime, we get that the following are the only possible factorizations: - (p1xp3)(x+1)p2=p1p3(p_{1} x-p_{3})(x+1) \Rightarrow p_{2}=p_{1}-p_{3} - (p1x+p3)(x1)p2=p1+p3(p_{1} x+p_{3})(x-1) \Rightarrow p_{2}=-p_{1}+p_{3} - (p1x1)(x+p3)p2=p1p31(p_{1} x-1)(x+p_{3}) \Rightarrow p_{2}=p_{1} p_{3}-1 - (p1x+1)(xp3)p2=p1p3+1(p_{1} x+1)(x-p_{3}) \Rightarrow p_{2}=-p_{1} p_{3}+1 In the first case, observe that since p2+p3=p1p_{2}+p_{3}=p_{1}, we have p1>2p_{1}>2, so p1p_{1} is odd and exactly one of p2,p3p_{2}, p_{3} is equal to 2. Thus, we get a solutions for every pair of twin primes below 50, which we enumerate to be (3,5),(5,7),(11,13),(17,19),(29,31),(41,43)(3,5),(5,7),(11,13),(17,19),(29,31),(41,43), giving 12 solutions in total. Similarly, the second case gives p1+p2=p3p_{1}+p_{2}=p_{3}, for another 12 solutions. In the third case, if p1,p3p_{1}, p_{3} are both odd, then p2p_{2} is even and thus equal to 2. However, this gives p1p3=3p_{1} p_{3}=3, which is impossible. Therefore, at least one of p1,p3p_{1}, p_{3} is equal to 2. If p1=2p_{1}=2, we get p2=2p31p_{2}=2 p_{3}-1, which we find has 4 solutions: (p2,p3)=(3,2),(5,3),(13,7),(37,19)(p_{2}, p_{3})=(3,2),(5,3),(13,7),(37,19). Similarly, there are four solutions with p3=2p_{3}=2. However, we count the solution (p1,p2,p3)=(2,3,2)(p_{1}, p_{2}, p_{3})=(2,3,2) twice, so we have a total of 7 solutions in this case. Finally, in the last case p2=p1p3+1<(2)(2)+1<0p_{2}=-p_{1} p_{3}+1<-(2)(2)+1<0 so there are no solutions. Hence, we have a total of 12+12+7=3112+12+7=31 solutions.

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.