Difference between revisions of "2000 AIME II Problems/Problem 4"
(rewrite) |
(→Solution) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | We use the fact that the number of divisors of a number <math>n = p_1^{e_1}p_2^{e_2} \cdots p_k^{e_k}</math> is <math>(e_1 + 1)(e_2 + 1) \cdots (e_k + 1)</math>. If a number has <math>18 = 2 \cdot | + | We use the fact that the number of divisors of a number <math>n = p_1^{e_1}p_2^{e_2} \cdots p_k^{e_k}</math> is <math>(e_1 + 1)(e_2 + 1) \cdots (e_k + 1)</math>. If a number has <math>18 = 2 \cdot 3 \cdot 3</math> factors, then it can have at most <math>3</math> distinct primes in its factorization. |
Dividing the greatest power of <math>2</math> from <math>n</math>, we have an odd integer with six positive divisors, which indicates that it either is (<math>6 = 2 \cdot 3</math>) a prime raised to the <math>5</math>th power, or two primes, one of which is squared. The smallest example of the former is <math>3^5 = 243</math>, while the smallest example of the latter is <math>3^2 \cdot 5 = 45</math>. | Dividing the greatest power of <math>2</math> from <math>n</math>, we have an odd integer with six positive divisors, which indicates that it either is (<math>6 = 2 \cdot 3</math>) a prime raised to the <math>5</math>th power, or two primes, one of which is squared. The smallest example of the former is <math>3^5 = 243</math>, while the smallest example of the latter is <math>3^2 \cdot 5 = 45</math>. |
Revision as of 21:11, 15 March 2011
Problem
What is the smallest positive integer with six positive odd integer divisors and twelve positive even integer divisors?
Solution
We use the fact that the number of divisors of a number is
. If a number has
factors, then it can have at most
distinct primes in its factorization.
Dividing the greatest power of from
, we have an odd integer with six positive divisors, which indicates that it either is (
) a prime raised to the
th power, or two primes, one of which is squared. The smallest example of the former is
, while the smallest example of the latter is
.
Suppose we now divide all of the odd factors from ; then we require a power of
with
factors, namely
. Thus, our answer is
.
See also
2000 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |