Difference between revisions of "2008 AIME I Problems/Problem 4"
m (→Solution 2: cmath) |
I like pie (talk | contribs) m (→Solution 3) |
||
Line 20: | Line 20: | ||
===Solution 3=== | ===Solution 3=== | ||
− | + | We see that <math>y^2 \equiv x^2 + 4 \pmod{6}</math>. By [[quadratic residue]]s, we find that either <math>x \equiv 0, 3 \pmod{6}</math>. Also, <math>y^2 \equiv (x+42)^2 + 244 \equiv (x+2)^2 \pmod{4}</math>, so <math>x \equiv 0, 2 \mod{4}</math>. Combining, we see that <math>x \equiv 0 \mod{6}</math>. | |
− | Testing <math>x = 6</math> and other multiples of <math>6</math>, we quickly find that <math>x = 18, y = 62</math> is the solution. | + | Testing <math>x = 6</math> and other multiples of <math>6</math>, we quickly find that <math>x = 18, y = 62</math> is the solution. |
== See also == | == See also == |
Revision as of 01:47, 25 March 2008
Problem
There exist unique positive integers and that satisfy the equation . Find .
Solution
Solution 1
Completing the square, . Thus by difference of squares.
Since is even, one of the factors is even. A parity check shows that if one of them is even, then both must be even. Sine , the factors must be and . Since , we have and ; the latter equation implies that .
Indeed, by solving, we find is the unique solution.
Solution 2
We complete the square like in the first solution: . Since consecutive squares differ by the consecutive odd numbers, we note that and must differ by an even number. We can use casework with the even numbers, starting with .
Thus, , which works, so .
Solution 3
We see that . By quadratic residues, we find that either . Also, , so . Combining, we see that .
Testing and other multiples of , we quickly find that is the solution.
See also
2008 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |