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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Method to solve

Expert replies
by ssgmatter » Sat Jun 19, 2010 7:34 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?
3 6 11 22 222
Best-
Amit
Join the discussion
Source: — Problem Solving |

by pradeepkaushal9518 » Sat Jun 19, 2010 7:53 pm
imo 6 is the answer

7,8,9 is the 3 digit sum = 24
Join the discussion

by ssgmatter » Sat Jun 19, 2010 7:54 pm
pradeepkaushal9518 wrote:imo 6 is the answer

7,8,9 is the 3 digit sum = 24
Nope!

OA 222
Best-
Amit
Join the discussion

by pradeepkaushal9518 » Sat Jun 19, 2010 7:56 pm
did i make some mistake in understanding the question? anyone
Join the discussion

by selango » Sat Jun 19, 2010 9:29 pm
X represents sum of all the positive three-digit numbers that can be
constructed using each of the distinct nonzero digits
in form of abc

it means abc=

123

132

134

143

sum of all 3 digits number that can be formed from 1,2.... 9 in abc
Join the discussion

by ssgmatter » Sat Jun 19, 2010 10:01 pm
selango wrote:X represents sum of all the positive three-digit numbers that can be
constructed using each of the distinct nonzero digits
in form of abc

it means abc=

123

132

134

143

sum of all 3 digits number that can be formed from 1,2.... 9 in abc
Please explain in details....
Best-
Amit
Join the discussion

by amising6 » Sat Jun 19, 2010 10:50 pm
ssgmatter 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?
3 6 11 22 222
sum of all 3 digit number using 1,2,3,....9
111*(3-1)!(1+2+3+4+5+6+7+8+9)=111*4*45= so now out of the given option (now one concept to find the sum of n digit using 1 to n digit is given by 11111...n(n-1)!(1+2+3+..+n))111*4*45
111*2*2*3*3*5
will be divisible by 3,6,222 so largest wil be 222
Ideation without execution is delusion
Join the discussion

by ssgmatter » Sat Jun 19, 2010 11:24 pm
amising6 wrote:
ssgmatter 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?
3 6 11 22 222
sum of all 3 digit number using 1,2,3,....9
111*(3-1)!(1+2+3+4+5+6+7+8+9)=111*4*45= so now out of the given option (now one concept to find the sum of n digit using 1 to n digit is given by 11111...n(n-1)!(1+2+3+..+n))111*4*45
111*2*2*3*3*5
will be divisible by 3,6,222 so largest wil be 222
can you please explain how did you use this formula to solve this question???....Is this a GMAT type question??...

Thanks!
Best-
Amit
Join the discussion

by jube » Sun Jun 20, 2010 4:00 am
For a, b & c, the possible 3 digit nos. can be:

100a + 10b + c
100a + 10c + b
100b + 10a + c
100b + 10c + a
100c + 10b + a
100c + 10a + b

Summing up the 6 nos. that are possible: 100(2a + 2b + 2c) + 10(2a + 2b + 2c) + (2a + 2b + 2c)
=(2a + 2b + 2c )(100 + 10 +1)=2(a + b +c)111=222(a+b+c)

therefore the no. will always be divisible by 222. Hence, E
Join the discussion

reply

by rohit56 » Mon Dec 17, 2018 10:14 pm
A 3-digit number 'abc' could be written as 100a + 10b + c.
Total possible arrangements of 'abc' are 3! = 6 arrangements
For exactly 2 times each digit a, b and c would be at each of the three places.
So, Sum of digits at hundredth place = 2(a + b + c)
Sum of digits at tens place = 2(a + b + c). Similar for ones place.
So, the total sum becomes = 100 x 2(a + b + c) + 10 x 2(a + b + c) + 2(a + b + c) = 222(a + b + c).
Hence, 222 is the answer.
Join the discussion