Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2016 AMC 10A Problems/Problem 22"

m (→‎Solution 2)
(→‎Video Solution)
 
(12 intermediate revisions by 6 users not shown)
Line 10: Line 10:
 
<math>110n^3</math> clearly has at least three distinct prime factors, namely 2, 5, and 11.
 
<math>110n^3</math> clearly has at least three distinct prime factors, namely 2, 5, and 11.
  
−
Furthermore, since the number of factors of <math>p_1^{n_1}\cdots p_k^{n_k}</math> is <math>(n_1+1)\cdots(n_k+1)</math> when the <math>p</math>'s are distinct primes, we see that there can be at most three distinct prime factors for a number with 110 factors.
+
The number of factors of <math>p_1^{n_1}\cdots p_k^{n_k}</math> is <math>(n_1+1)\cdots(n_k+1)</math> when the <math>p</math>'s are distinct primes. This tells us that none of these factors can be 1. The number of factors is given as 110. The only way to write 110 as a product of at least three factors without <math>1</math>s is <math>2\cdot 5\cdot 11</math>.
  
 
We conclude that <math>110n^3</math> has only the three prime factors 2, 5, and 11 and that the multiplicities are 1, 4, and 10 in some order.  I.e., there are six different possible values of <math>n</math> all of the form <math>n=p_1\cdot p_2^3</math>.
 
We conclude that <math>110n^3</math> has only the three prime factors 2, 5, and 11 and that the multiplicities are 1, 4, and 10 in some order.  I.e., there are six different possible values of <math>n</math> all of the form <math>n=p_1\cdot p_2^3</math>.
  
 
<math>81n^4</math> thus has prime factorization <math>81n^4=3^4\cdot p_1^4\cdot p_2^{12}</math> and a factor count of <math>5\cdot5\cdot13=\boxed{\textbf{(D) }325}</math>
 
<math>81n^4</math> thus has prime factorization <math>81n^4=3^4\cdot p_1^4\cdot p_2^{12}</math> and a factor count of <math>5\cdot5\cdot13=\boxed{\textbf{(D) }325}</math>
 +
 +
==Video Solution==
 +
https://youtu.be/hAEsBh64VSY
 +
 +
~savannahsolver
 +
 +
== Video Solution by OmegaLearn ==
 +
https://youtu.be/ZhAZ1oPe5Ds?t=3694
 +
 +
~ pi_is_3.14
 +
 +
==Video Solution==
 +
https://www.youtube.com/watch?v=IxIinK0p8o4&list=PLyhPcpM8aMvJewbDgg6W1h6WjWqP-v4Uy&index=2
 +
 +
- AMBRIGGS
  
 
==See Also==
 
==See Also==
 
{{AMC10 box|year=2016|ab=A|num-b=21|num-a=23}}
 
{{AMC10 box|year=2016|ab=A|num-b=21|num-a=23}}
 
{{AMC12 box|year=2016|ab=A|num-b=17|num-a=19}}
 
{{AMC12 box|year=2016|ab=A|num-b=17|num-a=19}}
 +
 +
[[Category:Intermediate Number Theory Problems]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 18:27, 30 December 2022

Problem

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have?

$\textbf{(A) }110\qquad\textbf{(B) }191\qquad\textbf{(C) }261\qquad\textbf{(D) }325\qquad\textbf{(E) }425$

Solution 1

Since the prime factorization of $110$ is $2 \cdot 5 \cdot 11$, we have that the number is equal to $2 \cdot 5 \cdot 11 \cdot n^3$. This has $2 \cdot 2 \cdot 2=8$ factors when $n=1$. This needs a multiple of 11 factors, which we can achieve by setting $n=2^3$, so we have $2^{10} \cdot 5 \cdot 11$ has $44$ factors. To achieve the desired $110$ factors, we need the number of factors to also be divisible by $5$, so we can set $n=2^3 \cdot 5$, so $2^{10} \cdot 5^4 \cdot 11$ has $110$ factors. Therefore, $n=2^3 \cdot 5$. In order to find the number of factors of $81n^4$, we raise this to the fourth power and multiply it by $81$, and find the factors of that number. We have $3^4 \cdot 2^{12} \cdot 5^4$, and this has $5 \cdot 13 \cdot 5=\boxed{\textbf{(D) }325}$ factors.

Solution 2

$110n^3$ clearly has at least three distinct prime factors, namely 2, 5, and 11.

The number of factors of $p_1^{n_1}\cdots p_k^{n_k}$ is $(n_1+1)\cdots(n_k+1)$ when the $p$'s are distinct primes. This tells us that none of these factors can be 1. The number of factors is given as 110. The only way to write 110 as a product of at least three factors without $1$s is $2\cdot 5\cdot 11$.

We conclude that $110n^3$ has only the three prime factors 2, 5, and 11 and that the multiplicities are 1, 4, and 10 in some order. I.e., there are six different possible values of $n$ all of the form $n=p_1\cdot p_2^3$.

$81n^4$ thus has prime factorization $81n^4=3^4\cdot p_1^4\cdot p_2^{12}$ and a factor count of $5\cdot5\cdot13=\boxed{\textbf{(D) }325}$

Video Solution

https://youtu.be/hAEsBh64VSY

~savannahsolver

Video Solution by OmegaLearn

https://youtu.be/ZhAZ1oPe5Ds?t=3694

~ pi_is_3.14

Video Solution

https://www.youtube.com/watch?v=IxIinK0p8o4&list=PLyhPcpM8aMvJewbDgg6W1h6WjWqP-v4Uy&index=2

- AMBRIGGS

See Also

2016 AMC 10A (Problems • Answer Key • Resources)
Preceded by
Problem 21 		Followed by
Problem 23
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions
2016 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 17 		Followed by
Problem 19
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_AMC_10A_Problems/Problem_22&oldid=185276"