It is currently 21 Nov 2017, 07:10

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

What is the remainder when the positive integer n is divided

Author Message
VP
Joined: 22 Nov 2007
Posts: 1078

Kudos [?]: 688 [0], given: 0

What is the remainder when the positive integer n is divided [#permalink]

Show Tags

26 Jan 2008, 09:04
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

What is the remainder when the positive integer n is divided by 3?
(1) The remainder when n is divided by 2 is 1.
(2) The remainder when n + 1 is divided by 3 is 2.

Kudos [?]: 688 [0], given: 0

CEO
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4669 [0], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40

Show Tags

26 Jan 2008, 10:17
B

1. 3 and 5 satisfy condition but have different remainders. Insufficient.

2. n+1=3k+2 ==> n=3k+1. remainder=1. sufficient.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Kudos [?]: 4669 [0], given: 360

VP
Joined: 22 Nov 2007
Posts: 1078

Kudos [?]: 688 [0], given: 0

Show Tags

27 Jan 2008, 04:01
walker wrote:
B

1. 3 and 5 satisfy condition but have different remainders. Insufficient.

2. n+1=3k+2 ==> n=3k+1. remainder=1. sufficient.

can we solve this one with mod. arithmetic?

Kudos [?]: 688 [0], given: 0

CEO
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4669 [0], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40

Show Tags

27 Jan 2008, 07:45
(n+1)mod3=2

(n)mod3+1mod3=2

(n)mod3=2-1=1

it is too easy.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Kudos [?]: 4669 [0], given: 360

Manager
Joined: 01 Jan 2008
Posts: 222

Kudos [?]: 64 [0], given: 2

Schools: Booth, Stern, Haas

Show Tags

27 Jan 2008, 08:39
walker wrote:
(n+1)mod3=2

(n)mod3+1mod3=2

(n)mod3=2-1=1

it is too easy.

what does word "mod" mean ?

Kudos [?]: 64 [0], given: 2

CEO
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4669 [0], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40

Show Tags

27 Jan 2008, 08:42
kazakhb wrote:
what does word "mod" mean ?

(n)(mod m) means remainder when n is divided by m
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Kudos [?]: 4669 [0], given: 360

CEO
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4669 [0], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40

Show Tags

30 Jan 2008, 03:03
Sorry, guys. My definition of mod was incorrect.

x=r(mod y) means x=k*y+r
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Kudos [?]: 4669 [0], given: 360

Re: remainder   [#permalink] 30 Jan 2008, 03:03
Display posts from previous: Sort by

What is the remainder when the positive integer n is divided

Moderator: chetan2u

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.