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 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

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
Limited cohort · enrollment openTarget 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.

Question Pack 1 = A positive integer is divisible by 3 if an

Expert replies
by richachampion » Thu Dec 08, 2016 3:57 pm
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 1k2,k24, where k represents a digit that occurs twice, how many values could n have?

A. 2
B. 3
C. 4
D. 5
E. 10
Last edited by richachampion on Thu Dec 08, 2016 3:59 pm, edited 1 time in total.
R I C H A,
My GMAT Journey: 470 → 720 → 740
Target Score: 760+
[email protected]
1. Press thanks if you like my solution.
2. Contact me if you are not improving. (No Free Lunch!)
Join the discussion
Source: — Problem Solving |

by richachampion » Thu Dec 08, 2016 3:58 pm
OA: C
R I C H A,
My GMAT Journey: 470 → 720 → 740
Target Score: 760+
[email protected]
1. Press thanks if you like my solution.
2. Contact me if you are not improving. (No Free Lunch!)
Join the discussion

by Matt@VeritasPrep » Thu Dec 08, 2016 7:31 pm
We need (1 + 2 + 2 + 4 + 2k), or (9 + 2k) to be divisible by 3. Since 9 is already divisible by 3, we just need 2k to be divisible by 3, or k to be divisible by 3.

Since k must be a single digit, we could have k = 0, 3, 6, or 9, so there are four options, and we're set!
Join the discussion

by Jay@ManhattanReview » Mon Dec 12, 2016 10:16 pm
Hi Richa,

Just for a change.. What is the answer of the questions had the question been as given below?
A positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3. If a six-digit integer n is divisible by 3, and it is of the form k12,k24, where k represents a digit that occurs twice, how many values could n have?

A. Two
B. Three
C. Four
D. Five
E. Ten
-Jay

_________________
Manhattan Review GMAT Prep

Locations: New York | Bangkok | Abu Dhabi | Rome | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
Join the discussion