by which x must be divisible

This topic has expert replies
User avatar
Master | Next Rank: 500 Posts
Posts: 117
Joined: Wed Dec 30, 2009 1:57 pm
Location: India
Thanked: 4 times
Followed by:1 members

by which x must be divisible

by abhi332 » Thu Feb 25, 2010 1:28 pm
If x represents the sum of all the positive three-digit numbers that can be constructed using each of the distinct
nonzero digits a, b, and c exactly once, what is the largest integer by which x must be divisible?
(A) 3
(B) 6
(C) 11
(D) 22
(E) 222

[spoiler]OA:E[/spoiler]
What you think, you become.
Source: — Problem Solving |

User avatar
Legendary Member
Posts: 1132
Joined: Mon Jul 20, 2009 3:38 am
Location: India
Thanked: 64 times
Followed by:6 members
GMAT Score:760

by harsh.champ » Thu Feb 25, 2010 1:36 pm
abhi332 wrote:If x represents the sum of all the positive three-digit numbers that can be constructed using each of the distinct
nonzero digits a, b, and c exactly once, what is the largest integer by which x must be divisible?
(A) 3
(B) 6
(C) 11
(D) 22
(E) 222

[spoiler]OA:E[/spoiler]
abc
acb
bca
bac
cba
cab
Each no. occurs exactly twice at units ,tens and hundreds place.
2a + 2(10a) + 2(100a)
Similarly for b and c
Hence, x = 2 x 111 (a+b+c)
= 222(a+b+c)

Hence,the answer is E
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P