Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 12 Sep 2010
Posts: 10

The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
20 Sep 2010, 00:56
2
This post received KUDOS
30
This post was BOOKMARKED
Question Stats:
47% (01:36) correct 53% (01:57) wrong based on 1002 sessions
HideShow timer Statistics
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?
Official Answer and Stats are available only to registered users. Register/ Login.
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: 779
Location: London

Re: DS:GCD of numbers. [#permalink]
Show Tags
20 Sep 2010, 02:20
5
This post received KUDOS
4
This post was BOOKMARKED
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 writeups 1) Algebra101 2) Sequences 3) Set combinatorics 4) 3D geometry
My GMAT story
GMAT Club Premium Membership  big benefits and savings
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: 2699
Location: Malaysia
Concentration: Technology, Entrepreneurship
GMAT 1: 670 Q49 V31 GMAT 2: 710 Q50 V35

Re: DS:GCD of numbers. [#permalink]
Show Tags
20 Sep 2010, 02:34
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
_________________
Fight for your dreams :For all those who fear from Verbal lets give it a fight
Money Saved is the Money Earned
Jo Bole So Nihaal , Sat Shri Akaal
Support GMAT Club by putting a GMAT Club badge on your blog/Facebook
GMAT Club Premium Membership  big benefits and savings
Gmat test review : http://gmatclub.com/forum/670to710alongjourneywithoutdestinationstillhappy141642.html



Retired Moderator
Joined: 02 Sep 2010
Posts: 779
Location: London

Re: DS:GCD of numbers. [#permalink]
Show Tags
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 writeups 1) Algebra101 2) Sequences 3) Set combinatorics 4) 3D geometry
My GMAT story
GMAT Club Premium Membership  big benefits and savings



Math Expert
Joined: 02 Sep 2009
Posts: 44352

Re: DS:GCD of numbers. [#permalink]
Show Tags
20 Sep 2010, 04:07
10
This post received KUDOS
Expert's post
15
This post was BOOKMARKED
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? SOME NOTES:1. GCD and LCMThe greatest common divisor (GCD), of two or more nonzero 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: gmatproblemsolvingps140/Please post DS questions in the DS subforum: gmatdatasufficiencyds141/
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Retired Moderator
Status: Accepting donations for the mohater MBA debt repayment fund
Joined: 05 Feb 2008
Posts: 1852
Location: United States
Concentration: Operations, Finance
GPA: 3.54
WE: Accounting (Manufacturing)

Re: DS:GCD of numbers. [#permalink]
Show Tags
20 Sep 2010, 04:08
Already posted: newsetofgoodds85441.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
GMAT Club Premium Membership  big benefits and savings



Math Expert
Joined: 02 Sep 2009
Posts: 44352

Re: DS:GCD of numbers. [#permalink]
Show Tags
20 Sep 2010, 04:17



Retired Moderator
Status: Accepting donations for the mohater MBA debt repayment fund
Joined: 05 Feb 2008
Posts: 1852
Location: United States
Concentration: Operations, Finance
GPA: 3.54
WE: Accounting (Manufacturing)

Re: DS:GCD of numbers. [#permalink]
Show Tags
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
GMAT Club Premium Membership  big benefits and savings



Manager
Joined: 04 Aug 2010
Posts: 138

Re: DS:GCD of numbers. [#permalink]
Show Tags
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 subing in numbers?



Retired Moderator
Joined: 02 Sep 2010
Posts: 779
Location: London

Re: DS:GCD of numbers. [#permalink]
Show Tags
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 subing 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 writeups 1) Algebra101 2) Sequences 3) Set combinatorics 4) 3D geometry
My GMAT story
GMAT Club Premium Membership  big benefits and savings



Math Expert
Joined: 02 Sep 2009
Posts: 44352

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
06 Jun 2013, 06:08



Manager
Joined: 28 Feb 2012
Posts: 114
Concentration: Strategy, International Business
GPA: 3.9
WE: Marketing (Other)

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
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!



Director
Joined: 29 Nov 2012
Posts: 850

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
10 Oct 2013, 06:52
What would be a good numerical example to satisfy statement 1 m=8, p=14?
_________________
Click +1 Kudos if my post helped...
Amazing Free video explanation for all Quant questions from OG 13 and much more http://www.gmatquantum.com/og13th/
GMAT Prep software What if scenarios http://gmatclub.com/forum/gmatprepsoftwareanalysisandwhatifscenarios146146.html



Math Expert
Joined: 02 Sep 2009
Posts: 44352

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
10 Oct 2013, 07:22



Intern
Joined: 16 May 2015
Posts: 14

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
21 May 2015, 01:56
What if the numbers are 10 and 22 where gcf is 2 but remainder is only 1. shouldnt it be r>1 ? when equal to and greater wont that be insufficient ?



Math Expert
Joined: 02 Sep 2009
Posts: 44352

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
21 May 2015, 03:39



Intern
Joined: 15 Jul 2013
Posts: 5

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
15 Feb 2016, 07:57
Sorry, just checking. Is statement 1 not asking if the two numbers are not consecutive (as R>1). Then the first statement is stating that the GCF is 2 (for consecutive integers this is always 1)  hence suff. For statement two, mp is 30  this could be 15 *2 but also 6*5 which are consecutive  hence not sufficient.. Where (all) am I going wrong..



Current Student
Joined: 18 Sep 2015
Posts: 105
GMAT 1: 610 Q43 V31 GMAT 2: 610 Q47 V27 GMAT 3: 650 Q48 V31 GMAT 4: 700 Q49 V35
WE: Project Management (Health Care)

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
14 May 2016, 13:17
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
 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? 1. If r=1, that means that p=m+1, so we can try and get a definite answer for p=m+1, if not, then r>1. St1.  If p=m+1, that means that GCD(M,P)=1, since this is not the case, p is does not equal to m+1, and hence r>1. Hence, St1 sufficient. St2.  LCM(P,M)=30 > means: 1. all the distinct prime numbers are: 2,3,5. 2. since this is LCM, the max power of every prime mentioned above is 1. hence 2^1,3^1,5^1.  Now since 2<m<p, we can deduce that either m or p is prime.  case 1: m= 5 ; p= 2*3 > p=m+1  case 2: m=3; p=2*5=10 > p is not equal to m+1. hence St2 is not sufficient. Final answer: A.



Intern
Joined: 09 Oct 2015
Posts: 48

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
04 Aug 2016, 18:21
Bunuel wrote: Bumping for review and further discussion*. Get a kudos point for an alternative solution! *New project from GMAT Club!!! Check HEREHi Bunuel, I am just going to take a stab at this question by trying to rephrase the question. I am not sure if i am thinking in the right direction. Kindly let me know! The question mentions that m is not a factor of P. This could be rewritten as P = mQ + R . ( Q and R are positive integers) > R is not equal to 0 Now the questions asks us to find whether r ( or R as per our previous statement) is greater than 1 or not. All we need to know is whether we can prove that r is equal to 1. If r is equal to 1 then P and m will not have any common factors. . We dont have to bother about the value of r otherwise Looking at the statements: (1) the greatest common factor of m and p is 2  This means that P and m have common factors and thus r will be greater than 1 > Sufficient (2) the least common multiple of m and p is 30 Lets prove this by examples: 5 and 6 have no common factor but the LCM is 30 , R=1 15 & 10 have 5 as a common factor but the LCM is 30, R= 5 Hence insufficient Answer is thus A Regards, Shradha



NonHuman User
Joined: 09 Sep 2013
Posts: 6531

Re: The integers m and p are such that 2<m<p, and m is not a [#permalink]
Show Tags
10 Aug 2017, 12:47
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: The integers m and p are such that 2<m<p, and m is not a
[#permalink]
10 Aug 2017, 12:47






