• NEW! FREE Beat The GMAT Quizzes
    NEW! FREE Beat The GMAT Quizzes
    NEW! FREE Beat The GMAT Quizzes
    Hundreds of Questions Highly Detailed Reporting Expert Explanations TAKE A FREE GMAT QUIZ
  • 7 CATs FREE!
    If you earn 100 Forum Points

    Engage in the Beat The GMAT forums to earn
    100 points for $49 worth of Veritas practice GMATs FREE

    Veritas Prep
    VERITAS PRACTICE GMAT EXAMS
    Earn 10 Points Per Post
    Earn 10 Points Per Thanks
    Earn 10 Points Per Upvote
    REDEEM NOW

What is the remainder when the positive integer n is divided

This topic has 3 expert replies and 0 member replies

What is the remainder when the positive integer n is divided

Post
What is the remainder when the positive integer n is divided by 6?

(1) n when divided by 12 leaves a remainder of 1
(2) n when divided by 3 leaves a remainder of 1

What's the best way to determine which statement is sufficient?

  • +1 Upvote Post
  • Quote
  • Flag

GMAT/MBA Expert

Legendary Member
Joined
14 Jan 2015
Posted:
2667 messages
Followed by:
122 members
Upvotes:
1153
GMAT Score:
770
Post
ardz24 wrote:
What is the remainder when the positive integer n is divided by 6?

(1) n when divided by 12 leaves a remainder of 1
(2) n when divided by 3 leaves a remainder of 1

What's the best way to determine which statement is sufficient?
Statement 1
Case 1: n = 1. When 1 is divided by 6, the remainder is 1
Case 2: n = 13, When 13 is divided by 6, the remainder is 1.
Case 3: n = 25. When 25 is divided by 6, the remainder is 1.
Not matter what we pick, the remainder will always be 1. This statement alone is sufficient.

Statement 2
Case 1: n = 1. When 1 is divided by 6, the remainder is 1/
Case 2: n = 4, When 4 is divided by 6, the remainder is 4. Because we can generate different results, this statement alone is not sufficient.

The answer is A

_________________
Veritas Prep | GMAT Instructor

Veritas Prep Reviews
Save $100 off any live Veritas Prep GMAT Course

  • +1 Upvote Post
  • Quote
  • Flag
Enroll in a Veritas Prep GMAT class completely for FREE. Wondering if a GMAT course is right for you? Attend the first class session of an actual GMAT course, either in-person or live online, and see for yourself why so many students choose to work with Veritas Prep. Find a class now!

GMAT/MBA Expert

Legendary Member
Joined
14 Jan 2015
Posted:
2667 messages
Followed by:
122 members
Upvotes:
1153
GMAT Score:
770
Post
Useful takeaway for remainder data sufficiency questions. If I want to know what the remainder will be when x is divided by y, anytime a statement tells me what the remainder is when x is divided by a multiple of y, that statement will be sufficient. (In this case, we were looking for the remainder when n was divided by 6. Statement 1 told us the remainder when n was divided by 12, which is a multiple of 6, so we could deduce that this statement alone must be sufficient.)

_________________
Veritas Prep | GMAT Instructor

Veritas Prep Reviews
Save $100 off any live Veritas Prep GMAT Course

  • +1 Upvote Post
  • Quote
  • Flag
Enroll in a Veritas Prep GMAT class completely for FREE. Wondering if a GMAT course is right for you? Attend the first class session of an actual GMAT course, either in-person or live online, and see for yourself why so many students choose to work with Veritas Prep. Find a class now!

GMAT/MBA Expert

Post
ardz24 wrote:
What is the remainder when the positive integer n is divided by 6?

(1) n when divided by 12 leaves a remainder of 1
(2) n when divided by 3 leaves a remainder of 1
Target question: What is the remainder when the positive integer n is divided by 6?

Statement 1: n when divided by 12 leaves a remainder of 1
USEFUL RULE #1: "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3

No onto the question...........
Statement 1 does not tell us the quotient, so let's just say that n divided by 12 equals k with remainder 1
So, we can write: n = 12k + 1, where k is some integer
We can also write 12k a different way: n = (6)(2)(k) + 1
Or n = (6)(2k) + 1
As you can see, (6)(2k) is a multiple of 6, which means (6)(2k) + 1 is ONE MORE than a multiple of 6
So, when (6)(2k) + 1 (aka n) is divided by 6, the remainder must be 1
Since we can answer the target question with certainty, statement 1 is SUFFICIENT

Statement 2: n when divided by 3 leaves a remainder of 1
USEFUL RULE #2: If N divided by D leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.
For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

So, for statement 2, some possible values of n are: 1, 4, 7, 10, 13, 16, 19, 22, etc.
Let's TEST some values...
Case a: If n = 1, then the remainder is 1, when n is divided by 6
Case b: If n = 4, then the remainder is 4, when n is divided by 6
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

Answer: A

RELATED VIDEO: https://www.gmatprepnow.com/module/gmat-integer-properties/video/842

Cheers,
Brent

_________________
Brent Hanneson – Creator of GMATPrepNow.com
Use my video course along with Beat The GMAT's free 60-Day Study Guide

Sign up for free Question of the Day emails
And check out all of these free resources

  • +1 Upvote Post
  • Quote
  • Flag
GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMAT’s FREE 60-Day Study Guide and reach your target score in 2 months!
  • Target Test Prep
    5-Day Free Trial
    5-day free, full-access trial TTP Quant

    Available with Beat the GMAT members only code

    MORE DETAILS
    Target Test Prep
  • Veritas Prep
    Free Veritas GMAT Class
    Experience Lesson 1 Live Free

    Available with Beat the GMAT members only code

    MORE DETAILS
    Veritas Prep
  • Kaplan Test Prep
    Free Practice Test & Review
    How would you score if you took the GMAT

    Available with Beat the GMAT members only code

    MORE DETAILS
    Kaplan Test Prep
  • PrepScholar GMAT
    5 Day FREE Trial
    Study Smarter, Not Harder

    Available with Beat the GMAT members only code

    MORE DETAILS
    PrepScholar GMAT
  • EMPOWERgmat Slider
    1 Hour Free
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    EMPOWERgmat Slider
  • The Princeton Review
    FREE GMAT Exam
    Know how you'd score today for $0

    Available with Beat the GMAT members only code

    MORE DETAILS
    The Princeton Review
  • Magoosh
    Magoosh
    Study with Magoosh GMAT prep

    Available with Beat the GMAT members only code

    MORE DETAILS
    Magoosh
  • Economist Test Prep
    Free Trial & Practice Exam
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    Economist Test Prep
  • Varsity Tutors
    Award-winning private GMAT tutoring
    Register now and save up to $200

    Available with Beat the GMAT members only code

    MORE DETAILS
    Varsity Tutors
  • e-gmat Exclusive Offer
    Get 300+ Practice Questions
    25 Video lessons and 6 Webinars for FREE

    Available with Beat the GMAT members only code

    MORE DETAILS
    e-gmat Exclusive Offer

Top First Responders*

1 Ian Stewart 53 first replies
2 Brent@GMATPrepNow 36 first replies
3 Jay@ManhattanReview 29 first replies
4 GMATGuruNY 25 first replies
5 ceilidh.erickson 15 first replies
* Only counts replies to topics started in last 30 days
See More Top Beat The GMAT Members

Most Active Experts

1 image description Scott@TargetTestPrep

Target Test Prep

199 posts
2 image description Max@Math Revolution

Math Revolution

90 posts
3 image description Brent@GMATPrepNow

GMAT Prep Now Teacher

76 posts
4 image description Ian Stewart

GMATiX Teacher

62 posts
5 image description GMATGuruNY

The Princeton Review Teacher

44 posts
See More Top Beat The GMAT Experts