Maths Olympiad Prep

Library / /63 of 520

Number theory Difficulty 6.4 National olympiad Find the answer

Let p,q,rp, q, r be prime numbers and t,nt, n be natural numbers such that p2+qt=(p+t)np^2 +qt =(p + t)^n and p2+qr=t4p^2 + qr = t^4 .
a) Show that n<3n < 3.
b) Determine all the numbers p,q,r,t,np, q, r, t, n that satisfy the given conditions.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Given the equations:
p2+qt=(p+t)n p^2 + qt = (p + t)^n
p2+qr=t4 p^2 + qr = t^4

We need to show that n<3 n < 3 and determine all the numbers p,q,r,t,n p, q, r, t, n that satisfy the given conditions.

### Part (a): Show that n<3 n < 3

1. Assume n3 n \geq 3 . Then:
(p+t)n(p+t)3 (p + t)^n \geq (p + t)^3

2. Expanding (p+t)3 (p + t)^3 using the binomial theorem:
(p+t)3=p3+3p2t+3pt2+t3 (p + t)^3 = p^3 + 3p^2t + 3pt^2 + t^3

3. Since p2+qt=(p+t)n p^2 + qt = (p + t)^n , we have:
p2+qt(p+t)n p^2 + qt \leq (p + t)^n

4. For n3 n \geq 3 :
(p+t)np3+3p2t+3pt2+t3 (p + t)^n \geq p^3 + 3p^2t + 3pt^2 + t^3

5. Comparing the terms:
p2+qtp3+3p2t+3pt2+t3 p^2 + qt \leq p^3 + 3p^2t + 3pt^2 + t^3

6. Since qt3p2t+3pt2+t3 qt \leq 3p^2t + 3pt^2 + t^3 , and qt qt is linear in t t while the right-hand side is cubic in t t , it is clear that:
p2+qt<p3+3p2t+3pt2+t3 p^2 + qt < p^3 + 3p^2t + 3pt^2 + t^3

7. This leads to a contradiction because p2+qt p^2 + qt cannot be greater than or equal to (p+t)n (p + t)^n for n3 n \geq 3 .

8. Therefore, n<3 n < 3 .

### Part (b): Determine all the numbers p,q,r,t,n p, q, r, t, n

1. From part (a), we know n2 n \leq 2 . Since p2+qt>p+t p^2 + qt > p + t , n n cannot be 1. Thus, n=2 n = 2 .

2. Given n=2 n = 2 :
p2+qt=(p+t)2 p^2 + qt = (p + t)^2
p2+qt=p2+2pt+t2 p^2 + qt = p^2 + 2pt + t^2

3. Simplifying:
qt=2pt+t2 qt = 2pt + t^2
t(q2p)=t2 t(q - 2p) = t^2
t(q2pt)=0 t(q - 2p - t) = 0

4. Since t0 t \neq 0 :
q2p=t q - 2p = t

5. Substituting t=q2p t = q - 2p into the second equation:
p2+qr=(q2p)4 p^2 + qr = (q - 2p)^4

6. Simplifying modulo q q :
p2+qr0(modq) p^2 + qr \equiv 0 \pmod{q}
(q2p)40(modq) (q - 2p)^4 \equiv 0 \pmod{q}

7. Since q q is a prime number:
q(q2p)4 q \mid (q - 2p)^4
q16p4p2 q \mid 16p^4 - p^2
qp2(4p1)(4p+1) q \mid p^2(4p - 1)(4p + 1)

8. Since q>2p q > 2p :
q(4p1)(4p+1) q \mid (4p - 1)(4p + 1)

9. Considering q4p1 q \geq 4p - 1 and q4p+1 q \geq 4p + 1 :
q=4p1 or q=4p+1 q = 4p - 1 \text{ or } q = 4p + 1

10. For q=4p1 q = 4p - 1 :
p2+(4p1)r=(2p1)4 p^2 + (4p - 1)r = (2p - 1)^4
r=(2p1)4p24p1 r = \frac{(2p - 1)^4 - p^2}{4p - 1}

11. For p=2 p = 2 :
q=4(2)1=7 q = 4(2) - 1 = 7
t=q2p=74=3 t = q - 2p = 7 - 4 = 3
r=(2(2)1)4224(2)1=3447=8147=11 r = \frac{(2(2) - 1)^4 - 2^2}{4(2) - 1} = \frac{3^4 - 4}{7} = \frac{81 - 4}{7} = 11

12. Thus, (p,q,r,t,n)=(2,7,11,3,2) (p, q, r, t, n) = (2, 7, 11, 3, 2) .

13. For q=4p+1 q = 4p + 1 :
r=(2p+1)4p24p+1 r = \frac{(2p + 1)^4 - p^2}{4p + 1}
r=(p+1)(4p2+3p+1) r = (p + 1)(4p^2 + 3p + 1)

14. Since r r must be prime, 4p2+3p+1 4p^2 + 3p + 1 must be 1, which is not possible for any prime p p .

The final answer is (p,q,r,t,n)=(2,7,11,3,2) \boxed{ (p, q, r, t, n) = (2, 7, 11, 3, 2) }

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.