Given the equations:
p2+qt=(p+t)n
p2+qr=t4
We need to show that n<3 and determine all the numbers p,q,r,t,n that satisfy the given conditions.
### Part (a): Show that n<3
1. Assume n≥3. Then:
(p+t)n≥(p+t)3
2. Expanding (p+t)3 using the binomial theorem:
(p+t)3=p3+3p2t+3pt2+t3
3. Since p2+qt=(p+t)n, we have:
p2+qt≤(p+t)n
4. For n≥3:
(p+t)n≥p3+3p2t+3pt2+t3
5. Comparing the terms:
p2+qt≤p3+3p2t+3pt2+t3
6. Since qt≤3p2t+3pt2+t3, and qt is linear in t while the right-hand side is cubic in t, it is clear that:
p2+qt<p3+3p2t+3pt2+t3
7. This leads to a contradiction because p2+qt cannot be greater than or equal to (p+t)n for n≥3.
8. Therefore, n<3.
### Part (b): Determine all the numbers p,q,r,t,n
1. From part (a), we know n≤2. Since p2+qt>p+t, n cannot be 1. Thus, n=2.
2. Given n=2:
p2+qt=(p+t)2
p2+qt=p2+2pt+t2
3. Simplifying:
qt=2pt+t2
t(q−2p)=t2
t(q−2p−t)=0
4. Since t=0:
q−2p=t
5. Substituting t=q−2p into the second equation:
p2+qr=(q−2p)4
6. Simplifying modulo q:
p2+qr≡0(modq)
(q−2p)4≡0(modq)
7. Since q is a prime number:
q∣(q−2p)4
q∣16p4−p2
q∣p2(4p−1)(4p+1)
8. Since q>2p:
q∣(4p−1)(4p+1)
9. Considering q≥4p−1 and q≥4p+1:
q=4p−1 or q=4p+1
10. For q=4p−1:
p2+(4p−1)r=(2p−1)4
r=4p−1(2p−1)4−p2
11. For p=2:
q=4(2)−1=7
t=q−2p=7−4=3
r=4(2)−1(2(2)−1)4−22=734−4=781−4=11
12. Thus, (p,q,r,t,n)=(2,7,11,3,2).
13. For q=4p+1:
r=4p+1(2p+1)4−p2
r=(p+1)(4p2+3p+1)
14. Since r must be prime, 4p2+3p+1 must be 1, which is not possible for any prime p.
The final answer is (p,q,r,t,n)=(2,7,11,3,2)