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
GMATBootcamp Starts Sep 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & 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.

Positive Integers and remainders

Expert replies
by jzebra10 » Sun Nov 20, 2011 1:39 am
Please explain! I don't know how to tackle problems like these.

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 that k+n is a multiple of 35?
Join the discussion
Source: — Problem Solving |

by shankar.ashwin » Sun Nov 20, 2011 2:57 am
A number 'n' when divided by 5 leaves remainder 1
and when divided by 7 leaves remainder 3.

The number will be of the form '7A + 3'

A=1 -> 10 (when divided by 5 remainder = 0)
A=2 -> 17 (remainder 2)
A=3 -> 24 (reminder 4)
A=4 -> 31 (reminder 1) - - - - - Satisfies our condition

Now its said when 'k' is added to the number, its a multiple of 35.

So, 4 should be added to 31 to make it a multiple of 35. So k=4 IMO
Last edited by shankar.ashwin on Sun Nov 20, 2011 2:58 am, edited 1 time in total.
Join the discussion

by hoji » Sun Nov 20, 2011 2:57 am
in this kind of problems, we should translate the problem into mathematical equation:
when n is divided by 5, the remainder is 1 means : n=5X+1
when n is divided by 7, the remainder is 3 means : n=7y+3

here we exploit the "35" i.e., 5 and 7 are not given in vain: their product is 35;
by combining the above equations, we can solve the problem easily
for this(to combine), we put n on one side of the equation, on the other side of the equation, we initially write the product of 5 and 7: 35 => n=35T +... and further we insert 1 into x and y, finding the results of them, respectively: 5*1+1=6 and 7*1+3=10, and then we add the results 6 and 10. 16 goes to the end of the equation: n=35T+16 then what we should add to the right of the equation so that it becomes multiple of 35. 19 it is! k=19.
I know of no more encouraging fact than the unquestionable ability of a man to elevate his life by conscious endeavor.
Henry David Thoreau.

Sleep GMAT, eat GMAT, beat GMAT!
______________________________
Quant ----> 51
Verbal----> 44+
GMAT ----> 750+
Join the discussion

by GMATGuruNY » Sun Nov 20, 2011 4:05 am
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 examine the answer choices.
When the correct answer choice is added to n=31, the sum will be a multiple of 35.
We can quickly see that the smallest possible value that will work is k=4 in answer choice B:
n+k = 31+4 = 35.

The correct answer is B.
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