Difference between revisions of "2021 Fall AMC 12B Problems/Problem 12"
Scrabbler94 (talk | contribs) m (→Solution 7) |
Scrabbler94 (talk | contribs) m (→Solution 7) |
||
Line 72: | Line 72: | ||
==Solution 7== | ==Solution 7== | ||
− | Observe that <math>f(n)</math> equals the sum of the reciprocals of the positive divisors of <math>n</math>. Since 768 is a multiple of 384, every | + | Observe that <math>f(n)</math> equals the sum of the reciprocals of the positive divisors of <math>n</math>. Since 768 is a multiple of 384, every divisor of 384 will also be a divisor of 768. Then <math>f(768)-f(384)</math> equals the sum of the reciprocals of the positive divisors of 768 which are not divisors of 384. Since <math>768 = 2^8 \cdot 3</math> and <math>384 = 2^7 \cdot 3</math>, the divisors of 768 which are not divisors of 384 are <math>2^8 = 256</math> and <math>2^8 \cdot 3 = 768</math>. Therefore |
− | <cmath> f(768)-f(384) = \frac{1}{ | + | <cmath> f(768)-f(384) = \frac{1}{256} + \frac{1}{768} = \frac{3 + 1}{768} = \boxed{\textbf{(B) } \frac{1}{192}}.</cmath> |
− | + | ~scrabbler94 | |
== Video Solution by OmegaLearn == | == Video Solution by OmegaLearn == |
Latest revision as of 23:50, 13 June 2025
Contents
Problem
For a positive integer, let
be the quotient obtained when the sum of all positive divisors of
is divided by
For example,
What is
Solution 1
The prime factorizations of and
are
and
respectively. Note that
is the sum of all fractions of the form
where
is a positive divisor of
By geometric series, it follows that
Therefore, the answer is
~lopkiloinm ~MRENTHUSIASM
Solution 2
The prime factorization of is
so each of its positive divisors is of the form
or
for some integer
such that
We will use this fact to calculate the sum of all its positive divisors. Note that
is the sum of the two forms of positive divisors for all such
By geometric series, the sum of all positive divisors of
is
from which
Similarly, since the prime factorization of
is
we have
Therefore, the answer is
~mahaler
Solution 3
Let denotes the sum of all positive divisors of
so
Suppose that is the prime factorization of
Since
is multiplicative, we have
by geometric series.
The prime factorizations of and
are
and
respectively. Note that
Therefore, the answer is
~MRENTHUSIASM
Solution 4
Note that
Both numbers take the form
. Define a function
as being the sum of the factors for any number
, where
is a nonnegative integer.
If you list out the factors of a number , all the factors are even except for
and
. So to produce a list of factors for the number
, you can multiply all the factors on the first list by
and then add on
and
. Thus,
.
We need to find . This can be written as
. Our recursive formula states that
so
. Thus, the fraction simplifies to
. Note that we never needed to figure out what
or
were, sparing us a lot of calculation.
~Curious_crow
Solution 5
We know that
We want to find the difference of these so
We are only left with the even divisors of
on the fraction on the right so the answer would be the sum of all odd divisors of
(
and
) over
:
~pengf
Solution 6
As in Solution 1, the prime factorization of is
, and the prime factorization of
is
. Recalling the sum of factors formula and sum of the powers of 2 formula, we find that the sum of the factors of
is
, and the sum of factors of
is
. Then
, and
. So,
.
~ cxsmi
Solution 7
Observe that equals the sum of the reciprocals of the positive divisors of
. Since 768 is a multiple of 384, every divisor of 384 will also be a divisor of 768. Then
equals the sum of the reciprocals of the positive divisors of 768 which are not divisors of 384. Since
and
, the divisors of 768 which are not divisors of 384 are
and
. Therefore
~scrabbler94
Video Solution by OmegaLearn
https://youtu.be/jgyyGeEKhwk?t=1116
~ pi_is_3.14
Video Solution by TheBeautyofMath
~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 |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.