Difference between revisions of "1986 IMO Problems/Problem 1"
Paragdey01 (talk | contribs) m (→Solution) |
Paragdey01 (talk | contribs) (→Solution) |
||
Line 11: | Line 11: | ||
<math>d\equiv 2\pmod{4}: 2d-1</math> is not a perfect square. | <math>d\equiv 2\pmod{4}: 2d-1</math> is not a perfect square. | ||
− | Therefore, <math>d\equiv 1, | + | Therefore, <math>d\equiv 1, \pmod{4}.</math> Now consider <math>d\pmod{16}.</math> |
<math>d\equiv 1,13 \pmod{16}: 13d-1</math> is not a perfect square. | <math>d\equiv 1,13 \pmod{16}: 13d-1</math> is not a perfect square. |
Revision as of 10:18, 9 March 2018
Problem
Let be any positive integer not equal to or . Show that one can find distinct in the set such that is not a perfect square.
Solution
We do casework with mods.
is not a perfect square.
is not a perfect square.
Therefore, Now consider
is not a perfect square.
is not a perfect square.
As we have covered all possible cases, we are done.
1986 IMO (Problems) • Resources | ||
Preceded by First Problem |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |