Difference between revisions of "1986 IMO Problems/Problem 1"
Durianaops (talk | contribs) |
|||
Line 26: | Line 26: | ||
<cmath>2d=m^2-n^2=(m+n)(m-n)</cmath> can be deduced. Since <math>m^2-n^2</math> is even, <math>m</math> and <math>n</math> have the same parity, so <math>(m+n)(m-n)</math> is divisible by <math>4</math>. It follows that the odd integer <math>d</math> must be divisible by <math>2</math>, leading to a contradiction. We are done. | <cmath>2d=m^2-n^2=(m+n)(m-n)</cmath> can be deduced. Since <math>m^2-n^2</math> is even, <math>m</math> and <math>n</math> have the same parity, so <math>(m+n)(m-n)</math> is divisible by <math>4</math>. It follows that the odd integer <math>d</math> must be divisible by <math>2</math>, leading to a contradiction. We are done. | ||
+ | |||
+ | =Solution 3= | ||
+ | |||
+ | Suppose one can't find distinct a,b from the set <math>A=\{2,5,13,d\}</math> such that <math>ab-1</math> is a perfect square. | ||
+ | |||
+ | Let,<math>2d-1=x^2\cdots (1)</math> | ||
+ | <math>5d-1=y^2\cdots (2)</math> | ||
+ | <math>13d-1 =z^2 \cdots (3)</math>.b | ||
+ | |||
+ | Clearly <math>Z^2+1 = 13d = 3(5d)-2d= 3y^2-x^2+2</math>. | ||
+ | |||
+ | <math>\implies x^2 +z^2=3y^2+1</math>. | ||
+ | |||
+ | Clearly ,if <math>x^2,z^2</math> is 1 or 0 modulo 3 then it has no solution . | ||
+ | |||
+ | Suppose,<math>Z=3r</math> and <math>x=3</math>±<math>1</math>, | ||
+ | <math>\implies 3|z </math>, | ||
+ | |||
+ | <math>\implies 9|z^2</math>. | ||
+ | |||
+ | So,<math> 5d-1 \equiv 0 \pmod{9}</math> and <math>13d-1 \equiv 0 \pmod{9}</math>. | ||
+ | |||
+ | <math>\implies d \equiv 0 \pmod{d}</math>. | ||
+ | |||
+ | It is contradiction ! Since <math>9|5d-1</math>. | ||
+ | @ftheftics | ||
{{alternate solutions}} | {{alternate solutions}} | ||
{{IMO box|year=1986|before=First Problem|num-a=2}} | {{IMO box|year=1986|before=First Problem|num-a=2}} |
Revision as of 23:30, 20 January 2020
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
Solution 1
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.
Solution 2
Proof by contradiction:
Suppose , and . From the first equation, is an odd integer. Let . We have , which is an odd integer. Then and must be even integers, denoted by and respectively, and thus , from which can be deduced. Since is even, and have the same parity, so is divisible by . It follows that the odd integer must be divisible by , leading to a contradiction. We are done.
Solution 3
Suppose one can't find distinct a,b from the set such that is a perfect square.
Let,
.b
Clearly .
.
Clearly ,if is 1 or 0 modulo 3 then it has no solution .
Suppose, and ±, ,
.
So, and .
.
It is contradiction ! Since .
@ftheftics
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
1986 IMO (Problems) • Resources | ||
Preceded by First Problem |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |