2007 USAMO Problems/Problem 5
Revision as of 17:19, 2 May 2007 by Roadnottaken (talk | contribs) (I removed the "Solution 1" heading from the middle of the solution.~~~~)
Problem
Prove that for every nonnegative integer , the number is the product of at least (not necessarily distinct) primes.
Contents
[hide]Solution
We prove the result 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.
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 |