Difference between revisions of "1994 AHSME Problems/Problem 21"
(Created page with "==Problem== Find the number of counter examples to the statement: <cmath>``\text{If N is an odd positive integer the sum of whose digits is 4 and none of whose digits is 0, then...") |
(→Solution) |
||
Line 4: | Line 4: | ||
<math> \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 </math> | <math> \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 </math> | ||
==Solution== | ==Solution== | ||
+ | Since the sum of the digits of <math>N</math> is <math>4</math> and none of the digits are <math>0</math>, <math>N</math>'s digits must be the elements of the sets <math>\{1,1,1,1\},\{1,1,2\},</math> or <math>\{1,3\}</math>. In the first case, the only possible <math>N</math> is <math>1111</math>, and it can be checked that this is a counterexample because it is divisible by <math>11</math>. In the second case, <math>N</math> is either <math>211</math> or <math>121</math>. It can be checked that <math>211</math> is indeed prime, while <math>121</math> is divisible by <math>11</math>. Finally in the third case, both <math>13,31</math> are prime. So the final answer is <math>\boxed{\textbf{(C)} 2}</math>. |
Revision as of 12:28, 15 February 2016
Problem
Find the number of counter examples to the statement:
Solution
Since the sum of the digits of is and none of the digits are , 's digits must be the elements of the sets or . In the first case, the only possible is , and it can be checked that this is a counterexample because it is divisible by . In the second case, is either or . It can be checked that is indeed prime, while is divisible by . Finally in the third case, both are prime. So the final answer is .