Problem 01 (1959 IMO)
Solution 01 (Euclidean Algorithm)
It follows that is irreducible. Q.E.D.
Solution 02 (Proof by contradiction)
If a certain fraction is reducible, then the fraction is reducible, too. In this case, .
This fraction consists of two consecutives numbers, which never share any factor. So in this case, is irreducible, which is absurd.
Hence is irreducible. Q.E.D.
Solution 03
We notice that:
So it follows that and must be coprime for every natural number for the fraction to be irreducible. Now the problem simplifies to proving irreducible. We re-write this fraction as:
Since the denominator differs from a multiple of the numerator by 1, the numerator and the denominator must be relatively prime natural numbers. Hence it follows that is irreducible.
Q.E.D
Here You Can Download Full Problems To Test Yourself
Problem 02
For what real values of is
given (a) , (b) , (c) , where only non-negative real numbers are admitted for square roots?
Solution
The square roots imply that .
Square both sides of the given equation:
Add the first and the last terms to get:
Multiply the middle terms, and use to get:
Since the term inside the square root is a perfect square, and by factoring 2 out, we get:Use the property that to get
Case I: If , then , and the equation reduces to . This is precisely part (a) of the question, for which the valid interval is now
Case II: If , then and we haveWhich simplifies to
This tells there that there is no solution for (b), since we must have
For (c), we have , which means that , so the only solution is .
No comments:
Post a Comment