Difference between revisions of "2005 Alabama ARML TST Problems/Problem 13"
(→Solution) |
(→Solution) |
||
| Line 10: | Line 10: | ||
For the first one, the sum of the reciprocals of the divisors of <math>n</math> is therefore <math>1+\dfrac{1}{p_1}+\dfrac{1}{p_1^2}+\dfrac{1}{p_1^3}+\dfrac{1}{p_1^4}+\dfrac{1}{p_1^5}</math>. The smallest prime (2) makes that less than 2, and if <math>p_1</math> gets bigger, then that expression gets smaller, so there is absolutely no way that <math>n=p_1^5</math>. So the second case is true. | For the first one, the sum of the reciprocals of the divisors of <math>n</math> is therefore <math>1+\dfrac{1}{p_1}+\dfrac{1}{p_1^2}+\dfrac{1}{p_1^3}+\dfrac{1}{p_1^4}+\dfrac{1}{p_1^5}</math>. The smallest prime (2) makes that less than 2, and if <math>p_1</math> gets bigger, then that expression gets smaller, so there is absolutely no way that <math>n=p_1^5</math>. So the second case is true. | ||
| − | < | + | <center><math>\begin{eqnarray}1+\dfrac{1}{p_1}+\dfrac{1}{p_1p_2}+\dfrac{1}{p_1p_2^2}+\dfrac{1}{p_2}+\dfrac{1}{p_2^2}=2\\ |
\dfrac{p_1p_2^2+p_1p_2+p_1+p_2^2+p_2+1}{p_1p_2^2}=\dfrac{(p^2+p_2+1)(p_1+1)}{p_1p_2^2}=2\\ | \dfrac{p_1p_2^2+p_1p_2+p_1+p_2^2+p_2+1}{p_1p_2^2}=\dfrac{(p^2+p_2+1)(p_1+1)}{p_1p_2^2}=2\\ | ||
p_1p_2^2-p_1p_2-p_1=p_2^2+p_2+1\\ | p_1p_2^2-p_1p_2-p_1=p_2^2+p_2+1\\ | ||
p_1(p_2^2-p_2-1)=p_2^2+p_2+1 | p_1(p_2^2-p_2-1)=p_2^2+p_2+1 | ||
| − | \end{ | + | \end{eqnarray}</math></center> |
Therefore, <math>-p_1\equiv 1\bmod{p_2}</math>. Now the only way that that is possible is when <math>p_2=2</math>. Solving for <math>p_1</math>, we get that <math>p_1=7</math>. Checking, the sum of the reciprocals of the divisors of <math>\boxed{28}</math> indeed sum to 2, and 28 does have 6 factors. | Therefore, <math>-p_1\equiv 1\bmod{p_2}</math>. Now the only way that that is possible is when <math>p_2=2</math>. Solving for <math>p_1</math>, we get that <math>p_1=7</math>. Checking, the sum of the reciprocals of the divisors of <math>\boxed{28}</math> indeed sum to 2, and 28 does have 6 factors. | ||
==See also== | ==See also== | ||
Revision as of 11:53, 1 March 2008
Problem
There is one natural number with exactly 6 positive divisors, the sum of whose reciprocals is 2. Find that natural number.
Solution
Let the number be 
, and let 
and 
be primes. Therefore, one of the following is true:
For the first one, the sum of the reciprocals of the divisors of is therefore 
. The smallest prime (2) makes that less than 2, and if gets bigger, then that expression gets smaller, so there is absolutely no way that 
. So the second case is true.
\dfrac{p_1p_2^2+p_1p_2+p_1+p_2^2+p_2+1}{p_1p_2^2}=\dfrac{(p^2+p_2+1)(p_1+1)}{p_1p_2^2}=2\\ p_1p_2^2-p_1p_2-p_1=p_2^2+p_2+1\\ p_1(p_2^2-p_2-1)=p_2^2+p_2+1
\end{eqnarray}$ (Error compiling LaTeX. Unknown error_msg)Therefore, 
. Now the only way that that is possible is when 
. Solving for , we get that 
. Checking, the sum of the reciprocals of the divisors of 
indeed sum to 2, and 28 does have 6 factors.
