NoHalfMeasures
A positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3. If the six-digit integer is divisible by 3, and n is of the form 1k2,k24, where k represents a digit that occurs twice, how many values could n have?
A 2
B. 3
C. 4
D. 5
E 10
n is of the form :- 1k2k24 ....
Some of the digits except k :- 1 + 2 + 2 + 4 = 9
So for n to be divisible by 3 , k can take :- 0 or 3 or 6 or 9 . (4 values)
So one 'k' can be of 4 kinds and for each kind , another 'k' can be of that kind only ( similar to it ) i.e 1 kind.
So the number 'n' can be of :- 4 *1 = 4
Option C is the answer.
Please give me kudo s if you liked my explanation.