QR question for yall

[dexadental]

Advertisement - Members don't see this ad

Hey guys...I have a QR question for yall. Kaplan writes this stuff thinking we should be mathematicians or something...heh. The guy or gal who writes the solution writes it so incoherently that the common man such as myself can't even understand it. So can anyone solve this? (and kindly provide a solution or basis for their answer?) Here it is:
"How many of the three-digit numbers containing no digits other than 2, 3, or 4 are divisible by 3?"
Thanks all!

 

[bosox_9]

Hey guys...I have a QR question for yall. Kaplan writes this stuff thinking we should be mathematicians or something...heh. The guy or gal who writes the solution writes it so incoherently that the common man such as myself can't even understand it. So can anyone solve this? (and kindly provide a solution or basis for their answer?) Here it is:
"How many of the three-digit numbers containing no digits other than 2, 3, or 4 are divisible by 3?"
Thanks all!

Here's my approach. There are six combinations of those 3 digit numbers. The key to this question is a shortcut regarding numbers divisible by 3. If the sum of the digits of a number is divisible by three, then the number itself is divisible by three. The sums of the six possible number combinations below obviously all equal 9, which is divisible by 3 - so I would say the answer to the question is 6.

234
243
324
342
432
423

I dunno if kaplan expects you to know the shortcut or not, but that's how i would do it. Let me know if i'm wrong.

 

[dat_student]

so I would say the answer to the question is 6.

234
243
324
342
432
423
.

No, answer is 9.

222
333
444

The above are also divisible by 3.

 

[bosox_9]

No, answer is 9.

222
333
444

The above are also divisible by 3.

good call, i didn't consider repeating numbers. at least my logic was right.

 

[Divineimpetus]

If the QR on the DAT is that hard-I'm screwed.

 

[dentwannabe]

If the QR on the DAT is that hard-I'm screwed.

its not this hard. dont worry.

 

[Comet208]

its not this hard. dont worry.

just time consuming...