Difference between revisions of "2010 AIME II Problems/Problem 3"
Tempaccount (talk | contribs) (Adding problem section) |
Tempaccount (talk | contribs) (Remove extra problem section) |
||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
== Problem == | == Problem == | ||
Let <math>K</math> be the product of all factors <math>(b-a)</math> (not necessarily distinct) where <math>a</math> and <math>b</math> are integers satisfying <math>1\le a < b \le 20</math>. Find the greatest positive [[integer]] <math>n</math> such that <math>2^n</math> divides <math>K</math>. | Let <math>K</math> be the product of all factors <math>(b-a)</math> (not necessarily distinct) where <math>a</math> and <math>b</math> are integers satisfying <math>1\le a < b \le 20</math>. Find the greatest positive [[integer]] <math>n</math> such that <math>2^n</math> divides <math>K</math>. | ||
Revision as of 16:03, 9 August 2018
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.
- Number that are divisible by
at least once: 
- Exponent corresponding to each one of them

- Sum

- Number that are divisible by
at least twice: 
- Exponent corresponding to each one of them

- Sum

- Number 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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.