BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

by which x must be divisible

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Master | Next Rank: 500 Posts
Posts: 117
Joined: Wed Dec 30, 2009 1:57 pmFollowed by: 1 member
Location: India
Thanked: 4 times
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.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
User avatar
Legendary Member
Posts: 1132
Joined: Mon Jul 20, 2009 3:38 amFollowed by: 6 members
Location: India
Thanked: 64 times
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
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1