1986 AHSME Problems/Problem 4

Revision as of 17:05, 1 April 2018 by Hapaxoromenon (talk | contribs) (Added a solution with explanation)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let S be the statement "If the sum of the digits of the whole number $n$ is divisible by $6$, then $n$ is divisible by $6$."

A value of $n$ which shows $S$ to be false is

$\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 33 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 42 \qquad \textbf{(E)}\ \text{ none of these}$

Solution

For a counterexample, we need a number whose digit sum is divisible by $6$, but which is not itself divisible by $6$. $33$ satisfies these conditions, as $3+3=6$ but $6$ does not divide $33$, so the answer is $\boxed{B}$.

See also

1986 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 3
Followed by
Problem 5
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 26 27 28 29 30
All AHSME Problems and Solutions

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