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

Redeem

Help with remainder question

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 268
Joined: Sat Aug 15, 2009 9:22 am
Thanked: 19 times
Followed by:1 members
GMAT Score:700

Help with remainder question

by capnx » Thu Nov 19, 2009 3:55 pm
1st Q:
If n is a positive integer and r is the remainder when (n-1)(n+1) is divided by 24, what is the value of r?
1) n is not divisible by 2
2) n is not divisible by 3

2nd Q:
If r is the remainder when integer n is divided by 7, what is the value of r?
1) The remainder is an odd number when n is divided by 21
2) The remainder is 3 when n is divided by 28

Thanks for your explanation
Top
Source: — Data Sufficiency |
Senior | Next Rank: 100 Posts
Posts: 36
Joined: Fri Mar 27, 2009 6:53 pm

by adamsmith2009 » Thu Nov 19, 2009 4:31 pm
1st Q:
C

A) n = 3,5,7,9,11,13. If that's divided by 24 you'll get different answers so not sufficient
B) n = 1,2,4,7,10,13. If that's divided by 24 you'll get different answers so not sufficient

What's common in both is 7,13, etc. You'll notice that if you take n+1 and n-1 in both - (6)(8) and (12)(14) they both have a factor of 24 so there won't be any remainder. Sufficient.

2nd Q:
B

A) n = 22, 24, 26, 28, 30. If that's divided by 7 you'll get different answers so not sufficient
B) n = 31, 59, 87. If that's divided by 7 you'll get R=3 for all so sufficient.
Top
Master | Next Rank: 500 Posts
Posts: 199
Joined: Sat Oct 24, 2009 4:43 pm
Thanked: 22 times
GMAT Score:710

by palvarez » Thu Nov 19, 2009 8:12 pm
1. what is n^2 (mod 24), we need n^2 (mod 8) and n^2 (3)

1. n = 1 (mod 2)
n = 1,3, 5, 7 (mod 8)
n^2 = 1 (mod 8)
we need n^2 (mod 3). Insuff

2. n = 1 or 2 (mod 3)
n^2 = 1 (mod 3). We need n^2(mod 8). Insuff

Combined , n^2 = 1 (mod 8). Sufficient.


2. what is n (mod 7)

1. n = 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 (mod 21)
n = 1, 3, 5, 0, 2, 4, 6,1,3,5 (mod 7) Insufficient

2. n = 3 (mod 28)
n = 3 (mod 7) Sufficient. B is the answer
Top
Master | Next Rank: 500 Posts
Posts: 268
Joined: Sat Aug 15, 2009 9:22 am
Thanked: 19 times
Followed by:1 members
GMAT Score:700

by capnx » Fri Nov 20, 2009 4:29 pm
thanks guys... sorry I didn't understand any of that mod stuff, lol.
adam's solutions was pretty clear.

palv, are there any online websites that shows how to do the mod calculations?
thanks
Top
Newbie | Next Rank: 10 Posts
Posts: 7
Joined: Sun Jun 21, 2009 6:10 pm

by Willy » Fri Nov 20, 2009 8:38 pm
What is this modulo stuff...?
palvarez wrote:1. what is n^2 (mod 24), we need n^2 (mod 8) and n^2 (3)

1. n = 1 (mod 2)
n = 1,3, 5, 7 (mod 8)
n^2 = 1 (mod 8)
we need n^2 (mod 3). Insuff

2. n = 1 or 2 (mod 3)
n^2 = 1 (mod 3). We need n^2(mod 8). Insuff

Combined , n^2 = 1 (mod 8). Sufficient.


2. what is n (mod 7)

1. n = 1, 3, 5, 7, 9, 11, 13, 15, 17, 19 (mod 21)
n = 1, 3, 5, 0, 2, 4, 6,1,3,5 (mod 7) Insufficient

2. n = 3 (mod 28)
n = 3 (mod 7) Sufficient. B is the answer
Top
Post new topic Post Reply
• Page 1 of 1