# Difference between revisions of "2013 AMC 10B Problems/Problem 24"

## Problem

A positive integer $n$ is nice if there is a positive integer $m$ with exactly four positive divisors (including $1$ and $m$) such that the sum of the four divisors is equal to $n$. How many numbers in the set $\{ 2010,2011,2012,\dotsc,2019 \}$ are nice? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$

## Solution

A positive integer with only four positive divisors has its prime factorization in the form of $a*b$, where $a$ and $b$ are both prime positive integers or $c^3$ where $c$ is a prime. One can easily deduce that none of the numbers are even near a cube so that case is finished. We now look at the case of $a*b$. The four factors of this number would be $1$, $a$, $b$, and $ab$. The sum of these would be $ab+a+b+1$, which can be factored into the form $(a+1)(b+1)$. Easily we can see that now we can take cases again.

Case 1: Either $a$ or $b$ is 2.

If this is true then we have to have that one of $(a+1)$ or $(b+1)$ is odd and that one is 3. The other is still even. So we have that in this case the only numbers that work are even multiples of 3 which are 2010 and 2016. So we just have to check if either $\frac{2016}{3} - 1$ or $\frac{2010}{3} - 1$ is a prime. We see that in this case none of them work.

Case 2: Both $a$ and $b$ are odd primes.

This implies that both $(a+1)$ and $(b+1)$ are even which implies that in this case the number must be divisible by $4$. This leaves only $2012$ and $2016$. $2012=4*503$ so we have that a factor of $2$ must go to both $(a+1)$ and $(b+1)$. So we have that $(a+1)$ and $(b+1)$ equal the numbers $(502 + 1)(3 + 1)$, but $502$ is not an odd prime, so 2012 does not work. $2016 = 4 * 504$ so we have $(503 + 1)(3 + 1)$. 503 and 3 are both odd primes, so 2016 is a solution. Thus the answer is $\boxed{\textbf{(A)}\ 1}$.

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