1994 AHSME Problems/Problem 21


Find the number of counter examples to the statement: \[``\text{If  N is an odd positive integer the sum of whose digits is 4 and none of whose digits is 0, then N is prime}."\] $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4$


Since the sum of the digits of $N$ is $4$ and none of the digits are $0$, $N$'s digits must be the elements of the sets $\{1,1,1,1\},\{1,1,2\},$ or $\{1,3\}$. In the first case, the only possible $N$ is $1111$, and it can be checked that this is a counterexample because it is divisible by $11$. In the second case, $N$ is either $211$ or $121$. It can be checked that $211$ is indeed prime, while $121$ is divisible by $11$. Finally in the third case, both $13,31$ are prime. So the final answer is $\boxed{\textbf{(C)} 2}$.

Invalid username
Login to AoPS