December 17, 2018 December 17, 2018 06:00 PM PST 07:00 PM PST Join our live webinar and learn how to approach Data Sufficiency and Critical Reasoning problems, how to identify the best way to solve each question and what most people do wrong. December 17, 2018 December 17, 2018 10:00 PM PST 11:00 PM PST From Dec 5th onward, American programs will start releasing R1 decisions. Chat Rooms: We have also assigned chat rooms for every school so that applicants can stay in touch and exchange information/update during decision period.
Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 10 Feb 2010
Posts: 156

The positive integer k has exactly two positive prime
[#permalink]
Show Tags
20 Jun 2010, 11:38
Question Stats:
57% (01:55) correct 43% (02:15) wrong based on 423 sessions
HideShow timer Statistics
The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k? (1) 9 is a factor of k. (2) 49 is a factor of k.
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Sep 2009
Posts: 51258

Re: GMATPrep Question
[#permalink]
Show Tags
20 Jun 2010, 12:48
testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear.
_________________
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




Manager
Joined: 23 Apr 2010
Posts: 113
Location: Tx
Schools: NYU,UCLA,BOOTH,STANFORD

Re: GMATPrep Question
[#permalink]
Show Tags
30 Jun 2010, 04:49
Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. In the right question 2)49 is NOT a factor of K
_________________
This is not finished here...Watch me.....



Manager
Joined: 16 Feb 2010
Posts: 177

Re: GMATPrep Question
[#permalink]
Show Tags
03 Jul 2010, 01:08
Bunuel wrote: BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type.
Hope it's clear.
Good guess.....took me 10 minutes staring at the question trying to figure out wtf i was missing



Manager
Joined: 22 Oct 2009
Posts: 235
GPA: 3.88

Re: GMATPrep Question
[#permalink]
Show Tags
16 Aug 2010, 21:19
Phew! Glad to see I wasn't missing something ridiculous.
Could one of the mods modify the original question to make the two statements agree with each other ala Bunuel's correction?



Director
Status: Apply  Last Chance
Affiliations: IIT, Purdue, PhD, TauBetaPi
Joined: 17 Jul 2010
Posts: 624
Schools: Wharton, Sloan, Chicago, Haas
WE 1: 8 years in Oil&Gas

Re: GMATPrep Question
[#permalink]
Show Tags
16 Aug 2010, 21:56
Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. Bunuel Back to the contradiction part, so in this case because we are getting 2 different values for k from 1 and 2  that is why this is not a good gmat question? If (2) said 49 is NOT a factor of k, then looking at (2) alone we could reach the conclusion that k = 63 and 1 already gave us 63, hence D? Is the reasoning correct?
_________________
Consider kudos, they are good for health



Math Expert
Joined: 02 Sep 2009
Posts: 51258

Re: GMATPrep Question
[#permalink]
Show Tags
17 Aug 2010, 03:22
mainhoon wrote: Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. Bunuel Back to the contradiction part, so in this case because we are getting 2 different values for k from 1 and 2  that is why this is not a good gmat question? If (2) said 49 is NOT a factor of k, then looking at (2) alone we could reach the conclusion that k = 63 and 1 already gave us 63, hence D? Is the reasoning correct? Yes, it's not a good GMAT question as the single numerical value of k from (1) differs from the single numerical value of k from (2)  statements contradict each other. It seems that statement (2) should be: 49 is NOT a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. So as statement (1) is sufficient and statement (2) is also sufficient, answers is D. In this case each statement gives the same value of k, thus the problem of contradiction is resolved.
_________________
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



Intern
Joined: 06 Apr 2011
Posts: 13

Re: The positive integer k has exactly two positive prime
[#permalink]
Show Tags
20 Oct 2012, 09:36
Thanks Bunuel for clarifying both statements contradict. kept me going in circle for 4 minutes and then i referred to your explanation. +1 Kudos.....



Director
Joined: 29 Nov 2012
Posts: 759

Re: The positive integer k has exactly two positive prime
[#permalink]
Show Tags
27 Feb 2013, 03:35
Statement B is (2) 7^2 is not a factor of k.
In that case the example in statement 1 will be the only example that satisfies the condition plus we have to satisfy 6 factors
3^2 * 7^1
(2+1) (1+1) = 6 factors



Manager
Joined: 10 Mar 2013
Posts: 198
GMAT 1: 620 Q44 V31 GMAT 2: 690 Q47 V37 GMAT 3: 610 Q47 V28 GMAT 4: 700 Q50 V34 GMAT 5: 700 Q49 V36 GMAT 6: 690 Q48 V35 GMAT 7: 750 Q49 V42 GMAT 8: 730 Q50 V39

The positive integer k has exactly two positive prime
[#permalink]
Show Tags
22 Dec 2015, 05:14
Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. Bunuel, why can't either \(m\) or \(n\) be \(0\)?



Math Expert
Joined: 02 Sep 2009
Posts: 51258

Re: The positive integer k has exactly two positive prime
[#permalink]
Show Tags
22 Dec 2015, 05:27
TooLong150 wrote: Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. Bunuel, why can't either \(m\) or \(n\) be \(0\)? We are told that k has exactly two positive prime factors 3 and 7. Now, if say n is 0, then \(k=3^m*7^0=3^m*1\) and in this case k would have only one prime 3. Hope it's clear.
_________________
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



Intern
Joined: 09 Aug 2014
Posts: 21

The positive integer k has exactly two positive prime
[#permalink]
Show Tags
01 Oct 2016, 03:51
Bunuel wrote: testprep2010 wrote: The positive integer k has exactly two positive prime factors 3 and 7. If k has a total of 6 positive factors including 1 and k, what is the value of k?
(1) 9 is a factor of k. (2) 49 is a factor of k. Finding the Number of Factors of an Integer: First make prime factorization of an integer \(n=a^p*b^q*c^r\), where \(a\), \(b\), and \(c\) are prime factors of \(n\) and \(p\), \(q\), and \(r\) are their powers. The number of factors of \(n\) will be expressed by the formula \((p+1)(q+1)(r+1)\). NOTE: this will include 1 and n itself. Example: Finding the number of all factors of 450: \(450=2^1*3^2*5^2\) Total number of factors of 450 including 1 and 450 itself is \((1+1)*(2+1)*(2+1)=2*3*3=18\) factors. Back to the original question:"k has exactly two positive prime factors 3 and 7" > \(k=3^m*7^n\), where \(m=integer\geq{1}\) and \(n=integer\geq{1}\); "k has a total of 6 positive factors including 1 and k" > \((m+1)(n+1)=6\). Note here that neither \(m\) nor \(n\) can be more than 2 as in this case \((m+1)(n+1)\) will be more than 6. So, there are only two values of \(k\) possible: 1. if \(m=1\) and \(n=2\) > \(k=3^1*7^2=3*49\); 2. if \(m=2\) and \(n=1\) > \(k=3^2*7^1=9*7\). (1) 9 is a factor of k > we have the second case, hence \(k=3^2*7^1=9*7\). Sufficient. (2) 49 is a factor of k > we have the first case, hence \(k=3^1*7^2=3*49\). Sufficient. Answer: D. BUT: in DS statements never contradict, so this cannot be real GMAT question. I guess one of the statements should be "x is NOT factor of k". In this case answer still would be D, but the question will be of GMAT type. Hope it's clear. May i ask you one question? As i understand that " k has a total of 6 positive factors which includes 1 and k, + exactly two positive prime factors, 3 and 7 " which mean factors k can be (1,3,3,3,7,k) or (1,3,3,7,7,k) or (1,3,7,7,7,k) So, (1): 9 is a factor of k > we can have two cases: (1,3,3,3,7,63) or (1,3,3,7,7,441) > insufficient same for (2): > insufficient Combine: Sufficient: Please correct me if i misunderstand the point here Thank alot P/s: Oh i just realized that there is another factor here is 21 (3*7), I'm sorry, you are correct ! Thanks



NonHuman User
Joined: 09 Sep 2013
Posts: 9198

Re: The positive integer k has exactly two positive prime
[#permalink]
Show Tags
02 Jul 2018, 20:54
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 positive integer k has exactly two positive prime &nbs
[#permalink]
02 Jul 2018, 20:54






