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 "2021 Fall AMC 12B Problems/Problem 12"
m (→‎Solution 6)
 
(49 intermediate revisions by 7 users not shown)
Line 1: Line 1:
 
==Problem==
 
==Problem==
−
For <math>n</math> a positive integer, let <math>f(n)</math> be the quotient obtained when the sum of all positive divisors  
+
For <math>n</math> a positive integer, let <math>f(n)</math> be the quotient obtained when the sum of all positive divisors of <math>n</math> is divided by <math>n.</math> For example, <cmath>f(14)=(1+2+7+14)\div 14=\frac{12}{7}</cmath>
−
of n is divided by n. For example,  
 
−
<cmath>f(14)=(1+2+7+14)\div 14=\frac{12}{7}</cmath>
 
 
What is <math>f(768)-f(384)?</math>
 
What is <math>f(768)-f(384)?</math>
  
Line 10: Line 8:
 
==Solution 1==
 
==Solution 1==
  
−
The prime factorization of <math>768</math> is <math>2^8\cdot3,</math> and the prime factorization of <math>384</math> is <math>2^7\cdot3.</math> Note that
+
The prime factorizations of <math>768</math> and <math>384</math> are <math>2^8\cdot3</math> and <math>2^7\cdot3,</math> respectively. Note that <math>f(n)</math> is the sum of all fractions of the form <math>\frac 1d,</math> where <math>d</math> is a positive divisor of <math>n.</math> By geometric series, it follows that
 
<cmath>\begin{alignat*}{8}
 
<cmath>\begin{alignat*}{8}
−
f(768)&=\left(1+\frac{1}{2}+\cdots+\frac{1}{2^8}\right)+\left(\frac{1}{3}+\frac{1}{2\cdot3}+\cdots+\frac{1}{2^8\cdot3}\right)&&=\left(1+\frac{1}{2}+\cdots+\frac{1}{2^8}\right)\left(1+\frac{1}{3}\right)&&=\frac{511}{256}\cdot\frac{4}{3}&&=\frac{511}{192}, \\
+
f(768)&=\left(\sum_{k=0}^{8}\frac{1}{2^k}\right)+\left(\sum_{k=0}^{8}\frac{1}{2^k\cdot3}\right)&&=\frac{511}{256}+\frac{511}{768}&&=\frac{2044}{768}, \\
−
f(384)&=\left(1+\frac{1}{2}+\cdots+\frac{1}{2^7}\right)+\left(\frac{1}{3}+\frac{1}{2\cdot3}+\cdots+\frac{1}{2^7\cdot3}\right)&&=\left(1+\frac{1}{2}+\cdots+\frac{1}{2^7}\right)\left(1+\frac{1}{3}\right)&&=\frac{255}{128}\cdot\frac{4}{3}&&=\frac{85}{32}.
+
f(384)&=\left(\sum_{k=0}^{7}\frac{1}{2^k}\right)+\left(\sum_{k=0}^{7}\frac{1}{2^k\cdot3}\right)&&=\frac{255}{128}+\frac{255}{384}&&=\frac{1020}{384}.
 
\end{alignat*}</cmath>
 
\end{alignat*}</cmath>
−
Therefore, the answer is <cmath>f(768)-f(384)=\frac{511}{192}-\frac{85}{32}=\frac{511}{192}-\frac{510}{192}=\boxed{\textbf{(B)}\ \frac{1}{192}}.</cmath>
+
Therefore, the answer is <math>f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.</math>
 +
 
 
~lopkiloinm ~MRENTHUSIASM
 
~lopkiloinm ~MRENTHUSIASM
  
 
==Solution 2==
 
==Solution 2==
  
−
Let <math>\sigma(n)</math> denotes the sum of the positive integer divisors of <math>n,</math> so <math>f(n)=\frac{\sigma(n)}{n}.</math>
+
The prime factorization of <math>384</math> is <math>2^7\cdot3,</math> so each of its positive divisors is of the form <math>2^m</math> or <math>2^m\cdot3</math> for some integer <math>m</math> such that <math>0\leq m\leq7.</math> We will use this fact to calculate the sum of all its positive divisors. Note that <cmath>2^m + 2^m\cdot3 = 2^m\cdot(1+3) = 2^m\cdot4 = 2^m\cdot2^2 = 2^{m+2}</cmath> is the sum of the two forms of positive divisors for all such <math>m.</math> By geometric series, the sum of all positive divisors of <math>384</math> is <cmath>\sum_{k=2}^{9}2^k = \frac{2^{10}-2^2}{2-1} = 1020,</cmath> from which <math>f(384) = \frac{1020}{384}.</math> Similarly, since the prime factorization of <math>768</math> is <math>2^8 \cdot 3,</math> we have <math>f(768) = \frac{2044}{768}.</math>  
  
−
Suppose that <math>n=\prod_{i=1}^{k}p_i^{e_i}</math> is the prime factorization of <math>n.</math> Since <math>\sigma(n)</math> is multiplicative, we have <cmath>\sigma(n)=\sigma\left(\prod_{i=1}^{k}p_i^{e_i}\right)=\prod_{i=1}^{k}\sigma\left(p_i^{e_i}\right)=\prod_{i=1}^{k}\left(\sum_{j=0}^{e_i}p_i^j\right)=\prod_{i=1}^{k}\frac{p_i^{e_i+1}-1}{p_i-1}.</cmath>
+
Therefore, the answer is <math>f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.</math>
−
The prime factorization of <math>768</math> is <math>2^8\cdot3,</math> and the prime factorization of <math>384</math> is <math>2^7\cdot3.</math> Note that
+
 
 +
~mahaler
 +
 
 +
==Solution 3==
 +
 
 +
Let <math>\sigma(n)</math> denotes the sum of all positive divisors of <math>n,</math> so <math>f(n)=\sigma(n)\div n.</math>
 +
 
 +
Suppose that <math>n=\prod_{i=1}^{k}p_i^{e_i}</math> is the prime factorization of <math>n.</math> Since <math>\sigma(n)</math> is multiplicative, we have <cmath>\sigma(n)=\sigma\left(\prod_{i=1}^{k}p_i^{e_i}\right)=\prod_{i=1}^{k}\sigma\left(p_i^{e_i}\right)=\prod_{i=1}^{k}\left(\sum_{j=0}^{e_i}p_i^j\right)=\prod_{i=1}^{k}\frac{p_i^{e_i+1}-1}{p_i-1}</cmath> by geometric series.
 +
 
 +
The prime factorizations of <math>768</math> and <math>384</math> are <math>2^8\cdot3</math> and <math>2^7\cdot3,</math> respectively. Note that
 
<cmath>\begin{alignat*}{8}
 
<cmath>\begin{alignat*}{8}
−
f(768) &= \left(\frac{2^9-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div768 &&= \frac{511}{192}, \\
+
f(768) &= \left(\frac{2^9-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div768 &&= \frac{2044}{768}, \\
−
f(384) &= \left(\frac{2^8-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div384 &&= \frac{85}{32}.
+
f(384) &= \left(\frac{2^8-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div384 &&= \frac{1020}{384}.
 
\end{alignat*}</cmath>
 
\end{alignat*}</cmath>
−
Therefore, the answer is <cmath>f(768)-f(384)=\frac{511}{192}-\frac{85}{32}=\frac{511}{192}-\frac{510}{192}=\boxed{\textbf{(B)}\ \frac{1}{192}}.</cmath>
+
Therefore, the answer is <math>f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.</math>
 +
 
 
~MRENTHUSIASM
 
~MRENTHUSIASM
  
−
==Solution 3==
+
==Solution 4==
 +
Note that
 +
<cmath>\begin{align*}
 +
384 &= 2^7\cdot3, \\
 +
768 &= 2^8\cdot3.
 +
\end{align*}</cmath>
 +
Both numbers take the form <math>2^n\cdot3</math>. Define a function <math>S(n)</math> as being the sum of the factors for any number <math>2^n\cdot3</math>, where <math>n</math> is a nonnegative integer.
 +
 
 +
If you list out the factors of a number <math>2^n\cdot3</math>, all the factors are even except for <math>1</math> and <math>3</math>. So to produce a list of factors for the number <math>2^{n+1}\cdot3</math>, you can multiply all the factors on the first list by <math>2</math> and then add on <math>1</math> and <math>3</math>. Thus, <math>S(n) = 2S(n-1) + 4</math>.
 +
 
 +
We need to find <math>\frac{S(8)}{768} - \frac{S(7)}{384}</math>. This can be written as <math>\frac{2S(7)+4-2S(7)}{768}</math>. Our recursive formula states that <math>S(n) = 2S(n-1) + 4</math> so <math>S(n) - 2S(n-1) = 4</math>. Thus, the fraction simplifies to <math>\frac{4}{768} = \boxed{\textbf{(B)}\ \frac{1}{192}}</math>. Note that we never needed to figure out what <math>S(8)</math> or <math>S(7)</math> were, sparing us a lot of calculation.
 +
 
 +
~Curious_crow
 +
 
 +
==Solution 5==
 +
We know that
 +
<cmath>\begin{align*}
 +
f(768) &= \frac{1 + 2 + 3 + 4 + \cdots + 768}{768}, \\
 +
f(384) &= \frac{1 + 2 + 3 + 4 + \cdots + 384}{384}.
 +
\end{align*}</cmath>
 +
We want to find the difference of these so
 +
<cmath>\frac{1 + 2 + 3 + 4 + \cdots + 768}{768} - \frac{ 2(1 + 2 + 3 + 4 + \cdots + 384)}{2\cdot384} = \frac{1 + 2 + 3 + 4 + \cdots + 768}{768} - \frac{ 2 + 4 + 6 + 8 + \cdots + 768}{768}.</cmath>
 +
We are only left with the even divisors of <math>768</math> on the fraction on the right so the answer would be the sum of all odd divisors  of <math>768</math> (<math>1</math> and <math>3</math>) over <math>768</math>:
 +
<cmath>\frac{1 + 3}{768}=\boxed{\textbf{(B)}\ \frac{1}{192}}.</cmath>
 +
~pengf
 +
 
 +
==Solution 6==
 +
As in Solution 1, the prime factorization of <math>768</math> is <math>2^8 \cdot 3</math>, and the prime factorization of <math>384</math> is <math>2^7 \cdot 3</math>. Recalling the sum of factors formula and sum of the powers of 2 formula, we find that the sum of the factors of <math>768</math> is <math>(1+2^1+2^2+2^3+2^4+2^5+2^6+2^7+2^8)(1+3^1)=(2^9-1)(4)=(511)(4)</math>, and the sum of factors of <math>384</math> is <math>1+2^1+2^2+2^3+2^4+2^5+2^6+2^7)(1+3^1)=(2^8-1)(4)=(255)(4)</math>. Then <math>f(768)=\frac{(511)(4)}{768}=\frac{511}{192}</math>, and <math>f(384)=\frac{(255)(4)}{384}=\frac{510}{192}</math>. So, <math>f(768)-f(384)=\frac{511}{192}-\frac{510}{192}=\boxed{\textbf{(B)}\ \frac{1}{192}}</math>.
 +
 
 +
~ [https://artofproblemsolving.com/wiki/index.php/User:Cxsmi cxsmi]
 +
 
 +
== Video Solution by OmegaLearn ==
 +
https://youtu.be/jgyyGeEKhwk?t=1116
  
−
We see that the prime factorization of <math>384</math> is <math>2^7 \cdot 3.</math> Each of its divisors is in the form of <math>2^x</math> or <math>2^x \cdot 3</math> for a nonnegative integer <math>x \le 7.</math> We can use this fact to our advantage when calculating the sum of all of them. Notice that <cmath>2^x + 2^x \cdot 3 = 2^x(1+3) = 2^x \cdot 4 = 2^x \cdot 2^2 = 2^{x+2}</cmath> is the sum of the two forms of divisors for each <math>x</math> from <math>0</math> to <math>7,</math> inclusive. So, the sum of all of the divisors of <math>384</math> is just <cmath>2^2 + 2^3 + 2^4 + \cdots + 2^9 = (2^0 + 2^1 + 2^2 + 2^3 + 2^4 + \cdots + 2^9) - (2^0 + 2^1) = (2^{10} - 1) - (2^0 + 2^1) = 1020.</cmath> Therefore, we have <math>f(384) = \frac{1020}{384}.</math> Similarly, since <math>768 = 2^8 \cdot 3,</math> we have <math>f(768) = \frac{2044}{768}.</math>
+
~ pi_is_3.14
  
−
Finally, the answer is <cmath>f(768) - f(384) = \frac{2044}{768} - \frac{1020}{384} = \frac{2044}{768} - \frac{2040}{768} = \frac{4}{768} = \boxed{\textbf{(B)}\ \frac{1}{192}}.</cmath>
+
==Video Solution by TheBeautyofMath==
 +
https://youtu.be/FFlj8W_xkPc
  
−
~mahaler
+
~IceMatrix
  
 
==See Also==
 
==See Also==
 
{{AMC12 box|year=2021 Fall|ab=B|num-a=13|num-b=11}}
 
{{AMC12 box|year=2021 Fall|ab=B|num-a=13|num-b=11}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 12:48, 4 April 2024

Problem

For $n$ a positive integer, let $f(n)$ be the quotient obtained when the sum of all positive divisors of $n$ is divided by $n.$ For example, \[f(14)=(1+2+7+14)\div 14=\frac{12}{7}\] What is $f(768)-f(384)?$

$\textbf{(A)}\ \frac{1}{768} \qquad\textbf{(B)}\ \frac{1}{192} \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ \frac{4}{3} \qquad\textbf{(E)}\ \frac{8}{3}$

Solution 1

The prime factorizations of $768$ and $384$ are $2^8\cdot3$ and $2^7\cdot3,$ respectively. Note that $f(n)$ is the sum of all fractions of the form $\frac 1d,$ where $d$ is a positive divisor of $n.$ By geometric series, it follows that \begin{alignat*}{8} f(768)&=\left(\sum_{k=0}^{8}\frac{1}{2^k}\right)+\left(\sum_{k=0}^{8}\frac{1}{2^k\cdot3}\right)&&=\frac{511}{256}+\frac{511}{768}&&=\frac{2044}{768}, \\ f(384)&=\left(\sum_{k=0}^{7}\frac{1}{2^k}\right)+\left(\sum_{k=0}^{7}\frac{1}{2^k\cdot3}\right)&&=\frac{255}{128}+\frac{255}{384}&&=\frac{1020}{384}. \end{alignat*} Therefore, the answer is $f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.$

~lopkiloinm ~MRENTHUSIASM

Solution 2

The prime factorization of $384$ is $2^7\cdot3,$ so each of its positive divisors is of the form $2^m$ or $2^m\cdot3$ for some integer $m$ such that $0\leq m\leq7.$ We will use this fact to calculate the sum of all its positive divisors. Note that \[2^m + 2^m\cdot3 = 2^m\cdot(1+3) = 2^m\cdot4 = 2^m\cdot2^2 = 2^{m+2}\] is the sum of the two forms of positive divisors for all such $m.$ By geometric series, the sum of all positive divisors of $384$ is \[\sum_{k=2}^{9}2^k = \frac{2^{10}-2^2}{2-1} = 1020,\] from which $f(384) = \frac{1020}{384}.$ Similarly, since the prime factorization of $768$ is $2^8 \cdot 3,$ we have $f(768) = \frac{2044}{768}.$

Therefore, the answer is $f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.$

~mahaler

Solution 3

Let $\sigma(n)$ denotes the sum of all positive divisors of $n,$ so $f(n)=\sigma(n)\div n.$

Suppose that $n=\prod_{i=1}^{k}p_i^{e_i}$ is the prime factorization of $n.$ Since $\sigma(n)$ is multiplicative, we have \[\sigma(n)=\sigma\left(\prod_{i=1}^{k}p_i^{e_i}\right)=\prod_{i=1}^{k}\sigma\left(p_i^{e_i}\right)=\prod_{i=1}^{k}\left(\sum_{j=0}^{e_i}p_i^j\right)=\prod_{i=1}^{k}\frac{p_i^{e_i+1}-1}{p_i-1}\] by geometric series.

The prime factorizations of $768$ and $384$ are $2^8\cdot3$ and $2^7\cdot3,$ respectively. Note that \begin{alignat*}{8} f(768) &= \left(\frac{2^9-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div768 &&= \frac{2044}{768}, \\ f(384) &= \left(\frac{2^8-1}{2-1}\cdot\frac{3^2-1}{3-1}\right)\div384 &&= \frac{1020}{384}. \end{alignat*} Therefore, the answer is $f(768)-f(384)=\boxed{\textbf{(B)}\ \frac{1}{192}}.$

~MRENTHUSIASM

Solution 4

Note that \begin{align*} 384 &= 2^7\cdot3, \\ 768 &= 2^8\cdot3. \end{align*} Both numbers take the form $2^n\cdot3$. Define a function $S(n)$ as being the sum of the factors for any number $2^n\cdot3$, where $n$ is a nonnegative integer.

If you list out the factors of a number $2^n\cdot3$, all the factors are even except for $1$ and $3$. So to produce a list of factors for the number $2^{n+1}\cdot3$, you can multiply all the factors on the first list by $2$ and then add on $1$ and $3$. Thus, $S(n) = 2S(n-1) + 4$.

We need to find $\frac{S(8)}{768} - \frac{S(7)}{384}$. This can be written as $\frac{2S(7)+4-2S(7)}{768}$. Our recursive formula states that $S(n) = 2S(n-1) + 4$ so $S(n) - 2S(n-1) = 4$. Thus, the fraction simplifies to $\frac{4}{768} = \boxed{\textbf{(B)}\ \frac{1}{192}}$. Note that we never needed to figure out what $S(8)$ or $S(7)$ were, sparing us a lot of calculation.

~Curious_crow

Solution 5

We know that \begin{align*} f(768) &= \frac{1 + 2 + 3 + 4 + \cdots + 768}{768}, \\ f(384) &= \frac{1 + 2 + 3 + 4 + \cdots + 384}{384}. \end{align*} We want to find the difference of these so \[\frac{1 + 2 + 3 + 4 + \cdots + 768}{768} - \frac{ 2(1 + 2 + 3 + 4 + \cdots + 384)}{2\cdot384} = \frac{1 + 2 + 3 + 4 + \cdots + 768}{768} - \frac{ 2 + 4 + 6 + 8 + \cdots + 768}{768}.\] We are only left with the even divisors of $768$ on the fraction on the right so the answer would be the sum of all odd divisors of $768$ ($1$ and $3$) over $768$: \[\frac{1 + 3}{768}=\boxed{\textbf{(B)}\ \frac{1}{192}}.\] ~pengf

Solution 6

As in Solution 1, the prime factorization of $768$ is $2^8 \cdot 3$, and the prime factorization of $384$ is $2^7 \cdot 3$. Recalling the sum of factors formula and sum of the powers of 2 formula, we find that the sum of the factors of $768$ is $(1+2^1+2^2+2^3+2^4+2^5+2^6+2^7+2^8)(1+3^1)=(2^9-1)(4)=(511)(4)$, and the sum of factors of $384$ is $1+2^1+2^2+2^3+2^4+2^5+2^6+2^7)(1+3^1)=(2^8-1)(4)=(255)(4)$. Then $f(768)=\frac{(511)(4)}{768}=\frac{511}{192}$, and $f(384)=\frac{(255)(4)}{384}=\frac{510}{192}$. So, $f(768)-f(384)=\frac{511}{192}-\frac{510}{192}=\boxed{\textbf{(B)}\ \frac{1}{192}}$.

~ cxsmi

Video Solution by OmegaLearn

https://youtu.be/jgyyGeEKhwk?t=1116

~ pi_is_3.14

Video Solution by TheBeautyofMath

https://youtu.be/FFlj8W_xkPc

~IceMatrix

See Also

2021 Fall AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 11 		Followed by
Problem 13
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=2021_Fall_AMC_12B_Problems/Problem_12&oldid=217817"