Difference between revisions of "1959 IMO Problems/Problem 1"
m |
(→Third Solution) |
||
Line 39: | Line 39: | ||
</center> | </center> | ||
− | Subtracting the second [[equation]] from the first [[equation]] we get <math>1\equiv 0\pmod{p}</math> which is | + | Subtracting the second [[equation]] from the first [[equation]] we get <math>1\equiv 0\pmod{p}</math> which is clearly absurd. |
Hence <math>\frac{21n+4}{14n+3}</math> is irreducible. Q.E.D. | Hence <math>\frac{21n+4}{14n+3}</math> is irreducible. Q.E.D. |
Revision as of 20:27, 23 February 2012
Problem
Prove that the fraction is irreducible for every natural number .
Solutions
First Solution
We observe that
Since a multiple of differs from a multiple of by 1, we cannot have any postive integer greater than 1 simultaneously divide and . Hence the greatest common divisor of the fraction's numerator and denominator is 1, so the fraction is irreducible. Q.E.D.
Second Solution
Denoting the greatest common divisor of as , we use the Euclidean algorithm as follows:
As in the first solution, it follows that is irreducible. Q.E.D.
Third Solution
Let's assume that is a reducible fraction where is a divisor of both the numerator and the denominator:
Subtracting the second equation from the first equation we get which is clearly absurd.
Hence is irreducible. Q.E.D.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
1959 IMO (Problems) • Resources | ||
Preceded by First question |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |