Difference between revisions of "1969 Canadian MO Problems/Problem 1"
Line 17: | Line 17: | ||
---- | ---- | ||
− | + | [[1969 Canadian MO Problems/Problem 2 | Next problem]] |
Revision as of 12:05, 8 October 2007
Problem
Show that if and are not all zero, then for every positive integer
Solution
Instead of proving the two expressions equal, we prove that their difference equals zero.
Subtracting the LHS from the RHS,
Finding a common denominator, the numerator becomes (The denominator is irrelevant since it never equals zero)
From Similarly, from
Hence, and our proof is complete.