Bunuel
If A = abc, a three digit number where a is the hundreds digit, b is the tens digit and c is the units digit, is A divisible by 3? (Given a, b and c are different.)
(1) b, c and a, in that order, form an arithmetic progression.
(2) b = a^2 and c = 3.
A number is divisible by 3 when the sum of its digits is divisible by 3 (1) b, c and a, in that order, form an arithmetic progression.
\( b\hspace{4mm}c\hspace{4mm} a \)
\(1 \hspace{4mm}2 \hspace{4mm}3\)
\(3 \hspace{4mm}2\hspace{4mm} 1\)
\(2 \hspace{4mm}3 \hspace{4mm}4\)
\(4\hspace{4mm} 3 \hspace{4mm}2\)
\(3\hspace{4mm} 4 \hspace{4mm}5\)
\(4\hspace{4mm} 5 \hspace{4mm}6\)
etc
Hence we can see that for various combinations of \(b, c\) and \(a \) the sum of its digit is divisible by \(3\) then this statement is
SUFF.(2) \(b = a^2 \) and \(c = 3.\)
so we have \(a \hspace{2mm}a^2\hspace{2mm} 3\)
a \(\neq 1\) because then \(a\) and \(a^2\) could become same. It is given that \( a,\) \(b\) and \(c\) are different.
if \(a=2\) then we have \(2\) \(4\) \(3\) hence this is divisible by \(3 \)
a \(\neq 3\) because then \(a\) and \(c\) would become same
a \(\ngeq 4\) because then \(a^2\) \( \geq \) \(16\) , which would not remain a single digit.
Hence the only combination possible for \(a\) \(b\) and \(c\) is \(2\) \(4\) \(3 \) and this is divisible by \(3\)
Hence
SUFF.Ans D
Hope it's clear