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

Redeem

If R is the reaminder when positive integer is divided by 7.

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Data Sufficiency |
User avatar
Master | Next Rank: 500 Posts
Posts: 392
Joined: Sun May 16, 2010 2:42 am
Location: Bangalore, India
Thanked: 116 times
Followed by:10 members
GMAT Score:770

by albatross86 » Wed Sep 01, 2010 11:11 am
n mod 7 = ?

1. n mod 21 = odd number

Since we cannot be sure what this odd number is, the corresponding value of r is also not identifiable.

Think of different values of N, such as 22 and 40 that would yield different odd remainders and correspondingly different values of r.

INSUFFICIENT

2. n mod 28 = 3

Since 28 is a multiple of 7, you can be sure that a (multiple of 28) + 3, will produce a number that also has a remainder of 3 when divided by 7.

Thus r = 3

SUFFICIENT

Pick B
~Abhay

Believe those who are seeking the truth. Doubt those who find it. -- Andre Gide
Top
User avatar
Legendary Member
Posts: 659
Joined: Mon Dec 14, 2009 8:12 am
Thanked: 32 times
Followed by:3 members

by Gurpinder » Wed Sep 01, 2010 2:31 pm
for a question like this one, instead of doing algebra think of it like this:

instead of: R is the remainder when positive integer is divided by 7
think like this: N is 3 more than a multiple of 7

now (1) is clearly insufficient.

n is n+odd multiple of 21. clearly insufficient as it could be anything.

(2)

n = 3 more than a multiple of 28

28 itself is a multiple of 7, so we can simply say n = 3 more than a multiple of 7.

therefore R = 3

hence (B).
"Do not confuse motion and progress. A rocking horse keeps moving but does not make any progress."
- Alfred A. Montapert, Philosopher.
Top
Post new topic Post Reply
• Page 1 of 1