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 12k,k24, where k represents a digit that occurs twice, how many values could n have?
Choose the correct choice from the following answers:
A) 2
B) 3
C) 6
D) 5
E) 4
12kk24   Taking sum of the numericals = 1 + 2 + 2 + 4= 
<gadget id="calculator">1 + 2 + 2 + 4</gadget>
<output>9</output>
9   We require the values of K such that they are also divisible by 3   120024   123324   126624   129924   Answer= 4 = 4
<result>E</result>
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 12k,k24, where k represents a digit that occurs twice, how many values could n have?