Difference between revisions of "2001 IMO Problems/Problem 6"
Pi3point14 (talk | contribs) |
(→See also) |
||
(3 intermediate revisions by 2 users not shown) | |||
Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
− | + | ||
First, <math>(KL+MN)-(KM+LN)=(K-N)(L-M)>0</math> as <math>K>N</math> and <math>L>M</math>. Thus, <math>KL+MN>KM+LN</math>. | First, <math>(KL+MN)-(KM+LN)=(K-N)(L-M)>0</math> as <math>K>N</math> and <math>L>M</math>. Thus, <math>KL+MN>KM+LN</math>. | ||
Line 25: | Line 25: | ||
==See also== | ==See also== | ||
− | {{IMO box|num-b=5| | + | {{IMO box|num-b=5|after=Last Problem|year=2001}} |
[[Category: Olympiad Number Theory Problems]] | [[Category: Olympiad Number Theory Problems]] |
Latest revision as of 23:23, 18 November 2023
Problem 6
are positive integers such that . Prove that is not prime.
Solution
First, as and . Thus, .
Similarly, since and . Thus, .
Putting the two together, we have
Now, we have: So, we have: Thus, it follows that Now, since if is prime, then there are no common factors between the two. So, in order to have we would have to have This is impossible as . Thus, must be composite.
See also
2001 IMO (Problems) • Resources | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Problem |
All IMO Problems and Solutions |