2007 USAMO Problems/Problem 5: Difference between revisions
No edit summary |
|||
| Line 5: | Line 5: | ||
__TOC__ | __TOC__ | ||
==Hint 1 of 3== | ==Hint 1 of 3== | ||
| Line 17: | Line 19: | ||
You may be stuck in "factoring" <math>\frac{a^7 + 1}{a + 1} = a^6 - a^5 + a^4 - a^3 + a^2 - a + 1</math> for <math>a = 7^{7^n}</math>. Keep trying! This is a #5 on a USAMO! | You may be stuck in "factoring" <math>\frac{a^7 + 1}{a + 1} = a^6 - a^5 + a^4 - a^3 + a^2 - a + 1</math> for <math>a = 7^{7^n}</math>. Keep trying! This is a #5 on a USAMO! | ||
==Hint 2 of 3== | ==Hint 2 of 3== | ||
Believe it or not, <math>\frac{a^7 + 1}{a + 1}</math> is a difference of squares! | Believe it or not, <math>\frac{a^7 + 1}{a + 1}</math> is a difference of squares! | ||
==Final Hint== | ==Final Hint== | ||
| Line 34: | Line 60: | ||
One of the perfect squares is <math>(x+1)^6</math>. | One of the perfect squares is <math>(x+1)^6</math>. | ||
==Solution== | ==Solution== | ||
Revision as of 12:40, 7 June 2014
Problem
Prove that for every nonnegative integer
, the number
is the product of at least
(not necessarily distinct) primes.
Hint 1 of 3
You may be stuck in "factoring"
for
. Keep trying! This is a #5 on a USAMO!
Hint 2 of 3
Believe it or not,
is a difference of squares!
Final Hint
One of the perfect squares is
.
Solution
Solution 1
We proceed by induction.
Let
be
. The result holds for
because
is the product of
primes.
Now we assume the result holds for
. Note that
satisfies the recursion
Since
is an odd power of
,
is a perfect square. Therefore
is a difference of squares and thus composite, i.e. it is divisible by
primes. By assumption,
is divisible by
primes. Thus
is divisible by
primes as desired.
Solution 2
Notice that
. Therefore it suffices to show that
is composite.
Let
. The expression becomes
which is the shortened form of the geometric series
. This can be factored as
.
Since
is an odd power of
,
is a perfect square, and so we can factor this by difference of squares. Therefore, it is composite.
See also
| 2007 USAMO (Problems • Resources) | ||
| Preceded by Problem 4 |
Followed by Problem 6 | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America.