Difference between revisions of "2010 AIME II Problems/Problem 3"
Tempaccount (talk | contribs) (Remove extra problem section) |
|||
Line 9: | Line 9: | ||
<br/> | <br/> | ||
− | * | + | *Numbers that are divisible by <math>2</math> at least once: <math>2, 4, \cdots, 18</math> |
:Exponent corresponding to each one of them <math>18, 16, \cdots 2</math> | :Exponent corresponding to each one of them <math>18, 16, \cdots 2</math> | ||
Line 16: | Line 16: | ||
<br/> | <br/> | ||
− | * | + | *Numbers that are divisible by <math>2</math> at least twice: <math>4, 8, \cdots, 16</math> |
:Exponent corresponding to each one of them <math>16, 12, \cdots 4</math> | :Exponent corresponding to each one of them <math>16, 12, \cdots 4</math> | ||
Line 24: | Line 24: | ||
<br/> | <br/> | ||
− | * | + | *Numbers that are divisible by <math>2</math> at least three times: <math>8,16</math> |
:Exponent corresponding to each one of them <math>12, 4</math> | :Exponent corresponding to each one of them <math>12, 4</math> |
Revision as of 12:07, 10 May 2020
Problem
Let be the product of all factors (not necessarily distinct) where and are integers satisfying . Find the greatest positive integer such that divides .
Solution
In general, there are pairs of integers that differ by because we can let be any integer from to and set equal to . Thus, the product is (or alternatively, .)
When we count the number of factors of , we have 4 groups, factors that are divisible by at least once, twice, three times and four times.
- Numbers that are divisible by at least once:
- Exponent corresponding to each one of them
- Sum
- Numbers that are divisible by at least twice:
- Exponent corresponding to each one of them
- Sum
- Numbers that are divisible by at least three times:
- Exponent corresponding to each one of them
- Sum
- Number that are divisible by at least four times:
- Exponent corresponding to each one of them
- Sum
Summing these give an answer of .
See also
2010 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.