Help with remainder question

[This topic has 4 member replies]
Free $100 Amazon.com Gift Card - Buy a GMAT course using a Beat The GMAT discount code between Mar 8-22 and get a $100 Amazon.com Gift Card. Learn more!
Post New Topic   Post Reply

capnx
Really wants to Beat The GMAT!

Default Avatar

Joined: 15 Aug 2009
Posts: 261

Thanks given: 7
Thanked 14 times in 14 posts

Target GMAT Score: 750
GMAT Score: 700

Topic: Help with remainder question
PostThu Nov 19, 2009 4:55 pm

Elapsed Time:
00:00
Lap   Why a timer is critical to improving your score

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
Back to top
View user's profile Send private message
adamsmith2009
Rising GMAT Star

Default Avatar

Joined: 27 Mar 2009
Posts: 34

Thanks given: 2
Thanked 0 times in 0 posts

PostThu Nov 19, 2009 5: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.
Back to top
View user's profile Send private message
palvarez
Really wants to Beat The GMAT!

Default Avatar

Joined: 24 Oct 2009
Posts: 199

Thanks given: 3
Thanked 19 times in 17 posts

GMAT Score: 710

PostThu Nov 19, 2009 9: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
Back to top
View user's profile Send private message
capnx
Really wants to Beat The GMAT!

Default Avatar

Joined: 15 Aug 2009
Posts: 261

Thanks given: 7
Thanked 14 times in 14 posts

Target GMAT Score: 750
GMAT Score: 700

PostFri Nov 20, 2009 5: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
Back to top
View user's profile Send private message
Willy
Just gettin' started!

Default Avatar

Joined: 21 Jun 2009
Posts: 7

Thanks given: 1
Thanked 0 times in 0 posts

PostFri Nov 20, 2009 9: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
Back to top
View user's profile Send private message
Display posts from previous:   

Post New Topic   Post Reply All times are GMT - 7 Hours
Page 1 of 1
 
Most Active Members in Last 30 Days
1. harsh.champ 562 posts
2. shashank.ism 368 posts
3. thephoenix 319 posts
4. kstv 310 posts
5. ajith 279 posts
Most Active Experts in Last 30 Days
1. lunarpower
Manhattan GMAT Teacher
87 posts
2. Stuart Kovinsky
Kaplan GMAT Teacher
63 posts
3. Lisa Anderson
Stacy Blackman Consulting
54 posts
4. Testluv
Kaplan GMAT Teacher
49 posts
5. Bryant@VeritasPrep
Veritas Prep
41 posts