Difference between revisions of "2006 AIME II Problems/Problem 3"
I Love Math (talk | contribs) m (Box the solution) |
|||
Line 18: | Line 18: | ||
threes in <math>100!</math> | threes in <math>100!</math> | ||
− | Therefore, we have a total of <math>97-48= | + | Therefore, we have a total of <math>97-48=\boxed{049}</math> threes. |
For more information, see also [[Factorial#Prime factorization| prime factorizations of a factorial]]. | For more information, see also [[Factorial#Prime factorization| prime factorizations of a factorial]]. |
Revision as of 15:30, 29 February 2020
Contents
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.
Solution 2
We count the multiples of below 200 and subtract the count of multiples of :
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.