|
Author |
Message |
|
TAGS:
|
|
|
Intern
Joined: 12 Sep 2010
Posts: 10
Followers: 0
Kudos [?]:
1
[0], given: 0
|
The integers m and p are such that 2<m<p, and m is not a [#permalink]
 20 Sep 2010, 00:56
Question Stats:
23% (03:01) correct
76% (01:31) wrong based on 51 sessions
The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1? (1) the greatest common factor of m and p is 2 (2) the least common multiple of m and p is 30 -------------------------------------------------------------- A small doubt! Are the concepts GCD,LCM applicable to negative numbers?If so,please explain and tel me why -ve numbers are not considered in the Fact1 of the following problem? -------------------------------------------------------------- I understood that Fact2 is not sufficient but am not sure about Fact1. If negative numbers are taken,then,for example, GCD(-8,6) is 2 and gives new remainder.Am I going wrong somewhere?
Last edited by Bunuel on 06 Jun 2013, 04:29, edited 2 times in total.
Edited the question and added the OA.
|
|
|
|
|
|
|
Retired Moderator
Joined: 02 Sep 2010
Posts: 814
Location: London
Followers: 57
Kudos [?]:
307
[1] , given: 25
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 02:20
1
This post received
KUDOS
ravitejapandiri wrote: A small doubt!Are the concepts GCD,LCM applicable to negative numbers?If so,please explain and tel me why -ve numbers are not considered in the Fact1 of the following problem? -------------------------------------------------------------- The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1? (1) the greatest common factor of m and p is 2 (2) the least common multiple of m and p is 30 -------------------------------------------------------------- I understood that Fact2 is not sufficient but am not sure about Fact1.If negative numbers are taken,then,for example, GCD(-8,6) is 2 and gives new remainder.Am I going wrong somewhere? (1) This is sufficient. We know gcd(m,p)=2, this means both m & p are even. Let q be the quotient and r the remainder when p is divided by m p = q*m + r Note that r cannot be 0, since if r=0, then m divides p and is therefore a factor of p, which we know is not true Also note r cannot be 1, since if r=1, them q*m (even number) + 1 (odd) is an odd number, which is not possible since we know that p is even Hence r>1. (2) Not sufficient. eg. m=6,p=15,lcm=30, remainder=3; m=5,p=6,lcm=30, remainder=1 Ans is (A)Note on negative numbersI am not entirely sure what the doubt above is, but atleast in this question we are given 2<m<p, so neither can be negative.
In general when talking about division using negative numbers, there can be two values of r, and we have to decide on definition before hand, so I dont think this something the GMAT can test on. Eg, consider division of 10 by -7. 10 = 1*(-7) + (-3) & 10=2*(-7) + (4). Both -3 and 4 are well defined remainders as both satisfy the condition 0<=Abs(remainder)<Abs(divisor). I have never seen GMAT questions deal with negative divisions & remainders because of this ambiguity.
_________________
Math write-ups
1) Algebra-101 2) Sequences 3) Set combinatorics 4) 3-D geometry
My GMAT story
Find out what's new at GMAT Club - latest features and updates
Last edited by shrouded1 on 20 Sep 2010, 02:40, edited 1 time in total.
|
|
|
|
|
|
CEO
Status: Nothing comes easy: neither do I want.
Joined: 12 Oct 2009
Posts: 2762
Location: Malaysia
Concentration: Marketing, Entrepreneurship
GMAT 1: 670 Q49 V31
GMAT 2: 710 Q50 V35
Followers: 126
Kudos [?]:
644
[0], given: 222
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 02:34
|
|
|
|
|
|
Retired Moderator
Joined: 02 Sep 2010
Posts: 814
Location: London
Followers: 57
Kudos [?]:
307
[0], given: 25
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 02:39
gurpreetsingh wrote: Shrouded1 :
m=10,p=30,lcm=30, remainder=0 --> is wrong , it is given that m is not a factor of P
you may take m =6 and p =10 Oops, you are right, I should take m=5, p=6, then remainder=1. Still works for the question Editing my solution
_________________
Math write-ups
1) Algebra-101 2) Sequences 3) Set combinatorics 4) 3-D geometry
My GMAT story
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 12116
Followers: 1879
Kudos [?]:
10130
[2] , given: 965
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 04:07
2
This post received
KUDOS
ravitejapandiri wrote: A small doubt!Are the concepts GCD,LCM applicable to negative numbers?If so,please explain and tel me why -ve numbers are not considered in the Fact1 of the following problem? -------------------------------------------------------------- The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1? (1) the greatest common factor of m and p is 2 (2) the least common multiple of m and p is 30 -------------------------------------------------------------- I understood that Fact2 is not sufficient but am not sure about Fact1.If negative numbers are taken,then,for example, GCD(-8,6) is 2 and gives new remainder.Am I going wrong somewhere? The greatest common divisor (GCD), of two or more non-zero integers, is the largest positive integer that divides the numbers without a remainder. So GCD can only be positive integer. It should be obvious as greatest factor of two integers can not be negative. For example if -3 is a factor of two integer then 3 is also a factor of these two integers. The lowest common multiple (LCM), of two integers a and b is the smallest positive integer that is a multiple both of a and of b. So LCM can only be positive integer. It's also quite obvious as if we don not limit LCM to positive integer then LCM won't make sense any more. For example what would be the lowest common multiple of 2 and 3 if LCM could be negative? There is no answer to this question. 2. DIVISIBILITY QUESTIONS ON GMATEVERY GMAT divisibility question will tell you in advance that any unknowns represent positive integers. 3. REMAINDERGMAT Prep definition of the remainder: If a and d are positive integers, there exists unique integers q and r, such that a = qd + r and 0\leq{r}<d. q is called a quotient and r is called a remainder. Moreover many GMAT books say factor is a "positive divisor", d>0. I've never seen GMAT question asking the remainder when dividend (a) is negative, but if we'll cancel this restriction (and consider dividend=a<0), but leave the other restriction ( 0\leq{r}<d), then division of negative integer by positive integer could be calculated as follow: -8 divided by 6 will result: 0\leq{r}<d, a=qd + r --> 0\leq{r}<6, -8=(-2)*6+4. Hence remainder=r=4. TO SUMMARIZE, DON'T WORRY ABOUT NEGATIVE DIVIDENDS, DIVISORS OR REMAINDERS ON GMAT. BACK TO THE ORIGINAL QUESTION:The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?Given: 2<m<p and \frac{p}{m}\neq{integer}, which means that r>0. Note here that as 0<2<m<p then your example of -8 and 6 is not valid as both m and p are positive. Question: r=?(1) the greatest common factor of m and p is 2 --> both p and m are even (as both have 2 as a factor) --> even divided by even can give only even remainder (0, 2, 4, ...), since remainder is not zero (as \frac{p}{m}\neq{integer}), then remainder must be more than 1: 2, 4, ... Sufficient. (2) the least common multiple of m and p is 30 --> if m=5 and p=6, remainder=1 =1, answer to the question would be NO. BUT if m=10 and p=15 remainder=5 >1 answer to the question would be YES. Two different answers. Not sufficient. Answer: A. Hope it helps. Also: Please post PS questions in the PS subforum: gmat-problem-solving-ps-140/Please post DS questions in the DS subforum: gmat-data-sufficiency-ds-141/
_________________
NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!! ,11 Mixed Questions NEW!!!, 12 Fresh Meat NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!, 11 New DS set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Forum Moderator
Status: Accepting donations for the mohater MBA fund
Joined: 05 Feb 2008
Posts: 1821
Location: United States
Concentration: Healthcare, Economics
GMAT 1: 710 Q48 V38
GMAT 2: Q V
GPA: 3.54
WE: Accounting (Manufacturing)
Followers: 39
Kudos [?]:
324
[0], given: 233
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 04:08
Already posted: new-set-of-good-ds-85441.htmlAlso, posted in the wrong forum. This belongs in the quant forum. Please search in the future before posting. Locked.
_________________
Strategy Discussion Thread | Strategy Master | GMAT Debrief| Please discuss strategies in discussion thread. Master thread will be updated accordingly. | GC Member Write Ups
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 12116
Followers: 1879
Kudos [?]:
10130
[1] , given: 965
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 04:17
1
This post received
KUDOS
|
|
|
|
|
|
GMAT Forum Moderator
Status: Accepting donations for the mohater MBA fund
Joined: 05 Feb 2008
Posts: 1821
Location: United States
Concentration: Healthcare, Economics
GMAT 1: 710 Q48 V38
GMAT 2: Q V
GPA: 3.54
WE: Accounting (Manufacturing)
Followers: 39
Kudos [?]:
324
[0], given: 233
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 05:34
Bunuel wrote: Moved to the proper subforum, so now it's unlocked for further discussion. booooo you stole my thunder 
_________________
Strategy Discussion Thread | Strategy Master | GMAT Debrief| Please discuss strategies in discussion thread. Master thread will be updated accordingly. | GC Member Write Ups
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Manager
Joined: 04 Aug 2010
Posts: 160
Followers: 2
Kudos [?]:
22
[0], given: 15
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 19:05
When evaluating statement (2) LCD = 30, is there a way to get the conclusion of insufficient by looking at the prime factors of 30 rather than sub-ing in numbers?
|
|
|
|
|
|
Retired Moderator
Joined: 02 Sep 2010
Posts: 814
Location: London
Followers: 57
Kudos [?]:
307
[0], given: 25
|
Re: DS:GCD of numbers. [#permalink]
20 Sep 2010, 20:13
FQ wrote: When evaluating statement (2) LCD = 30, is there a way to get the conclusion of insufficient by looking at the prime factors of 30 rather than sub-ing in numbers? Its one and the same thing. You are looking for 2 factors of 30, such that one is a multiple of the other OR p=km+1 and at the same time their LCM is 30.
_________________
Math write-ups
1) Algebra-101 2) Sequences 3) Set combinatorics 4) 3-D geometry
My GMAT story
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 12116
Followers: 1879
Kudos [?]:
10130
[0], given: 965
|
Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
06 Jun 2013, 06:08
|
|
|
|
|
|
Manager
Joined: 28 Feb 2012
Posts: 102
Concentration: Strategy, International Business
GPA: 3.9
WE: Marketing (Other)
Followers: 0
Kudos [?]:
24
[1] , given: 10
|
Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
06 Jun 2013, 23:17
1
This post received
KUDOS
ravitejapandiri wrote: The integers m and p are such that 2<m<p, and m is not a factor of p. if r is the remainder when p is divided by m, is r>1?
(1) the greatest common factor of m and p is 2
(2) the least common multiple of m and p is 30
(1) from this statement we know that both m and n are even integers, whenever we divide even integers to each other the remainder will be 0 or more than 1. However since m and n must be greater than 2 and the greatest common factor is 2, each integer contains some distinct from each other factors. For example, 4(2*2) and 6(3*2), 6(3*2) and 8(2*2*2). So the remainder will be greater than 1 in any case. Sufficient. (2) here we can have several integers that fit into the 2nd statement's condition and have different remainders. For example, 5 and 6, their LCM is 30 the remainder is 1; and 15 and 6, their LCM is again 30 but the remainder is greater than 1. Not sufficient.
_________________
If you found my post useful and/or interesting - you are welcome to give kudos!
|
|
|
|
|
|
|
Re: The integers m and p are such that 2<m<p, and m is not a
[#permalink]
06 Jun 2013, 23:17
|
|
|
|
|
|
|
|
|
|
|
close
