Difference between revisions of "2022 USAJMO Problems/Problem 5"
Bennetthuang (talk | contribs) (→Problem) |
Bennetthuang (talk | contribs) (→Solution 1) |
||
Line 3: | Line 3: | ||
==Solution 1== | ==Solution 1== | ||
− | We first consider the case where one of <math>p,q</math> is even. If <math>p</math> equals 2, <math>p-q=0</math> | + | We first consider the case where one of <math>p,q</math> is even. If <math>p</math> equals 2, <math>p-q=0</math> and <math>pq-q=2</math> which doesn't satisfy the problem restraints. If <math>q=2</math>, we can set <math>p-2=x^2</math> and <math>2p-2=y^2</math> giving us <math>p=y^2-x^2=(y+x)(y-x)</math>. This forces <math>y-x=1</math> so <math>p=2x+1</math> and <math>p=x^2+2</math>. We then have <math>2x+1=x^2+2 \rightarrow x=1 \rightarrow (p,q)=(3,2)</math>. |
Line 9: | Line 9: | ||
Therefore, the only solution to this problem is <math>(p,q)=(3,2)</math>. | Therefore, the only solution to this problem is <math>(p,q)=(3,2)</math>. | ||
+ | |||
+ | ~BennettHuang |
Revision as of 13:15, 3 August 2023
Problem
Find all pairs of primes for which and are both perfect squares.
Solution 1
We first consider the case where one of is even. If equals 2, and which doesn't satisfy the problem restraints. If , we can set and giving us . This forces so and . We then have .
Now assume that are both odd primes. Set and so . Since , . Note that is an even integer and since and have the same parity, they both must be even. Therefore, for some even integer . On the other hand, and . Therefore, so , giving us a contradiction.
Therefore, the only solution to this problem is .
~BennettHuang