Maths Olympiad Prep

Library / Belarus — Final Round /21 of 32

Belarus — Final Round

Number theory Difficulty 6.5 National Olympiad Prove it Belarus

Pairwise distinct prime numbers pp, qq, rr satisfy the equality
rp3+p2+p=2rq2+q2+q. rp^3 + p^2 + p = 2rq^2 + q^2 + q.

Solution

Answer: 2014.
By condition, rp3=−(p2+p)+2rq2+(q2+q)rp^3 = -(p^2 + p) + 2rq^2 + (q^2 + q), and p2+pp^2 + p, q2+qq^2 + q, 2rq22rq^2 are even for all natural pp and qq, then rp3rp^3 is also even. Therefore, since rr and pp are prime, we see that either p=2p = 2 or r=2r = 2.

If p=2p = 2, then the initial equality has the form 8r+4+2=2rq2+q2+q8r + 4 + 2 = 2rq^2 + q^2 + q. But this is impossible because the right-hand side of this expression is greater than its left-hand side. Indeed, since p=2p = 2 and q≠pq \neq p is prime, we have q>2q > 2, so 2rq2+q2+q>8r+4+22rq^2 + q^2 + q > 8r + 4 + 2.

Thus r=2r = 2 and the initial equality has the form 2p3+p2+p=4q2+q2+q2p^3 + p^2 + p = 4q^2 + q^2 + q, or
p(2p2+p+1)=q(5q+1).(1) p(2p^2 + p + 1) = q(5q + 1). \quad (1)
Since pp and qq are distinct prime numbers, we see that pp and qq are coprime. Then from (1) it follows that 2p2+p+12p^2 + p + 1 is divisible by qq, and 5q+15q + 1 is divisible by pp. Therefore 2p2+p+1=mq2p^2 + p + 1 = mq and 5q+1=mp5q + 1 = mp for some m∈Nm \in \mathbb{N}. We put q=(mp−1)/5q = (mp - 1)/5 into the former equality, then
10p2+(5−m2)p+(m+5)=0.(2) 10p^2 + (5 - m^2)p + (m + 5) = 0. \quad (2)
Consider this equality as a quadratic equation with respect to pp. Since the coefficients of (2) are integer and its root pp is integer, we obtain that the discriminant of (2) is necessarily a perfect square, i.e.
D=(m2−5)2−4⋅10⋅(m+5)=m4−10m2−40m−175=n2(3) D = (m^2 - 5)^2 - 4 \cdot 10 \cdot (m + 5) = m^4 - 10m^2 - 40m - 175 = n^2 \quad (3)
for some nonnegative integer nn. Since D<m4−175D < m^4 - 175, we see that for m=1,2,3m = 1, 2, 3 the discriminant is negative. Moreover, for m=4m = 4 we have D=256−160−160−175<0D = 256 - 160 - 160 - 175 < 0. Therefore m≥5m \ge 5.

From (3) it follows that (m2−5)2>n2(m^2 - 5)^2 > n^2. Show that n2>(m2−11)2n^2 > (m^2 - 11)^2. If not, then from (3) it follows that
(m2−5)2−40(m+5)≤(m2−11)2⇔3m2−10m−74≤0.(4) (m^2 - 5)^2 - 40(m + 5) \le (m^2 - 11)^2 \Leftrightarrow 3m^2 - 10m - 74 \le 0. \quad (4)
It is easy to see that the latter inequality holds only for m≤6m \le 6. But m≥5m \ge 5, so to prove that n2>(m2−11)2n^2 > (m^2 - 11)^2 it remains to show that for m=5m = 5 and m=6m = 6 equality (2) does not hold for prime pp.

If m=5m = 5, then (2) has the form 10p2−20p+10=010p^2 - 20p + 10 = 0 and has exactly one root p=1p = 1; but 11 is not prime number. If m=6m = 6, then the discriminant of (2) is equal to D=1296−360−240−175=521D = 1296 - 360 - 240 - 175 = 521; but 521521 is not perfect square.

Therefore (m2−11)2<n2<(m2−5)2(m^2 - 11)^2 < n^2 < (m^2 - 5)^2, i.e., taking into account that m≥7m \ge 7 and n≥0n \ge 0, we have m2−11<n<m2−5m^2 - 11 < n < m^2 - 5. Note that from (3) it follows that mm and nn have different parity, so nn can admit only two values n=m2−9n = m^2 - 9 or n=m2−7n = m^2 - 7.

If n=m2−9n = m^2 - 9, then from (3) we obtain m4−10m2−40m−175=(m2−9)2m^4 - 10m^2 - 40m - 175 = (m^2 - 9)^2 or m2−5m−32=0m^2 - 5m - 32 = 0. However, it is easy to see that the discriminant of this equation is equal to 153153, so the equation has no integer solutions.

If n=m2−7n = m^2 - 7, then from (3) we get m4−10m2−40m−175=(m2−7)2m^4 - 10m^2 - 40m - 175 = (m^2 - 7)^2 or m2−10m−56=0m^2 - 10m - 56 = 0. We see that m=−4m = -4 and m=14m = 14 are the roots of this equation. Since m∈Nm \in \mathbb{N}, we have m=14m = 14.

Therefore m=14m = 14, then n=m2−7=189n = m^2 - 7 = 189. From (2) we obtain p=(m2−5±n)/20=(191±189)/20p = (m^2 - 5 \pm n)/20 = (191 \pm 189)/20. Since pp is integer, we have p=19p = 19 which is prime. Hence q=(mp−1)/5=(14⋅19−1)/5=265/5=53q = (mp - 1)/5 = (14 \cdot 19 - 1)/5 = 265/5 = 53.

Thus the required value of the product is pqr=19⋅53⋅2=2014pqr = 19 \cdot 53 \cdot 2 = 2014.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.