Difference between revisions of "2006 AIME II Problems/Problem 3"
m (→See also: ii) |
|||
| Line 27: | Line 27: | ||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 22:24, 4 July 2013
Problem
Let 
be the product of the first 
positive odd integers. Find the largest integer 
such that is divisible by 
Solution
Note that the product of the first positive odd integers can be written as 
Hence, we seek the number of threes in 
decreased by the number of threes in 
There are
threes in and
threes in 
Therefore, we have a total of 
threes.
For more information, see also prime factorizations of a factorial.
See also
| 2006 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. 
