Announcement, 9/22/08: Beat The GMAT is thrilled to welcome Clear Admit and Accepted.com to our community!

Number properties


 
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency
View previous topic :: View next topic  
Author Message
Delph
Just gettin' started!


Joined: 19 Jun 2008
Posts: 5

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu Jul 17, 2008 11:52 am    Post subject: Number properties Reply with quote

Can anyone help me with?

This post contains an attachment. You must be logged in to download/view this file.
Please login or register as a user.

Back to top


View user's profile Send private message
Delph
Just gettin' started!


Joined: 19 Jun 2008
Posts: 5

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu Jul 17, 2008 11:53 am    Post subject: Reply with quote

And another one:

This post contains an attachment. You must be logged in to download/view this file.
Please login or register as a user.

Back to top


View user's profile Send private message
Canman
Rising GMAT Star


Joined: 11 Jul 2008
Posts: 58

Thanks given: 0
Thanked 4 times in 4 posts


Test Date: 8/16/2008
Target GMAT Score: 730+

PostPosted: Thu Jul 17, 2008 6:55 pm    Post subject: Reply with quote

My thoughts on Q2

n=multiple of 5 (or i=n/5)
n=(p^2)*(q)

Since (p^2)*(q) is a multiple of 5, then 5 must also be a factor of (p^2)*(q).

Therefore either p, q or both could be factors of 5 (but we don't know which ones)

To find which also must be factor of 25.

A. p^2 - not necessary because q could be the factor 5 and p could be some other prime number

B. q^2 - not necessary because p could be the factor 5 and q can be some other prime number

C. pq - not necessary because they may not both be factor 5 (and therefore not multiple of 25)

D. p^2*q^2, this works because either p or q (or both) will be the factor 5, so the square will satisfy the requirement of being a multiple of 25.

E. p^3*q -- if q is the factor 5 then this will not necessarily be a multiple of 25
Back to top


View user's profile Send private message
Mani_mba
Really wants to Beat The GMAT!


Joined: 16 Jul 2008
Posts: 164

Thanks given: 3
Thanked 3 times in 3 posts


PostPosted: Thu Jul 17, 2008 10:21 pm    Post subject: Reply to the Question 1 Reply with quote

a) Considering the first option that n is not divisible by 2.

N may have values: 3 5 7 9 11 13 15
And their respective
remainders when
n^2 - 1 divided by
24:
: 8 0 0 8 0 0 8 ..... and it repeats in this sequence.

So r may be either 0 or 8. hence insufficient.

Similarly (b) is insufficient as it produces different r's.

When (a) and (b) are taken together,

n may have values like 5,7,11,13,17 ... for which when (n^2-1) / 24 will always yield no remainder. So r is 0.

Hence choice (c).
Back to top


View user's profile Send private message
Delph
Just gettin' started!


Joined: 19 Jun 2008
Posts: 5

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Fri Jul 18, 2008 9:52 am    Post subject: Reply with quote

Thanks a lot!
Do you have any suggestions how to improve number properties skills?
That's my only weakness in Q section.
Back to top


View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency All times are GMT - 7 Hours
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You cannot download files in this forum



"GMAT" and other GMAC™ trademarks are registered trademarks of the Graduate Management Admission Council™. The Graduate Management Admission Council™ does not endorse, nor is it affiliated in any way with the owner or any content on this website. The opinions expressed here are solely those of the author or those of the members of this website. Copyright © 2008 BTG Test Prep, LLC. Powered by phpBB © 2001, 2005 phpBB Group.