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.

Quant Review- Divisibility

Expert replies
by DCS80 » Tue Mar 05, 2013 7:29 pm
When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest possible integer k such that k+n is a multiple of 35?

A)3
B) 4
C) 12
D) 32
E) 35

answer later.....(quant review wording for answer is very unclear for this problem)
Join the discussion
Source: — Problem Solving |

by Anurag@Gurome » Tue Mar 05, 2013 7:32 pm
DCS80 wrote:When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest possible integer k such that k+n is a multiple of 35?

A)3
B) 4
C) 12
D) 32
E) 35

answer later.....(quant review wording for answer is very unclear for this problem)
n = 5*a + 1.
n = 7*b + 3.
Here, a and b are integers.
Note that the difference between divider and remainder (5 - 1 and 7 - 3) is 4 in both the case.
So add 4 on both sides of each of the 2 equations.
So, we get n + 4 = 5*a + 5 = 5*(a + 1).
n+4 = 7*b + 7 = 7*(b + 1).
This means n+4 is a multiple of both 5 and 7.
Since 5 and 7 are co-prime, n + 4 has to be a multiple of 5 * 7 = 35 as well.
So the smallest possible value of k is 4.

The correct answer is B.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/
Join the discussion

by GMATGuruNY » Tue Mar 05, 2013 9:39 pm
kannans3 wrote: When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k+n is a multiple of 35?

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35
When positive integer n is divided by 5, the remainder is 1.
The smallest possible value of n that satisfies the statement above is the given remainder of 1.
To determine the other possible values of n, just keep adding multiples of the divisor 5:
1,6,11,16,21,26,31...

When positive integer n is divided by 7, the remainder is 3.
The smallest possible value of n that satisfies the statement above is the given remainder of 3.
To determine the other possible values of n, just keep adding multiples of the divisor 7:
3,10,17,24,31...

The smallest value included in both lists is n=31.

Now we can plug in the answers, which represent the smallest possible value of k.
When the correct answer is added to n=31, the sum will be a multiple of 35.
Since we need the smallest possible value of k, we should start with the smallest answer choice.

Answer choice A: k=3
n+k = 31+3 = 34. Not a multiple of 35.
Eliminate A.

Answer choice B: k=4
n+k = 31+4 = 35. Success!

The correct answer is B.

Another problem about remainders:

https://www.beatthegmat.com/remainder-t115616.html
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion