Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

The positive integer k has exactly two positive prime [#permalink]
20 Jun 2010, 11:38

5

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

45% (medium)

Question Stats:

48% (02:04) correct
52% (01:15) wrong based on 142 sessions

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?

Re: GMATPrep Question [#permalink]
20 Jun 2010, 12:48

5

This post received KUDOS

Expert's post

1

This post was BOOKMARKED

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.

Re: GMATPrep Question [#permalink]
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.

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

Re: GMATPrep Question [#permalink]
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? _________________

Re: GMATPrep Question [#permalink]
17 Aug 2010, 03:22

Expert's post

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. _________________

Re: The positive integer k has exactly two positive prime [#permalink]
17 Jun 2014, 07:14

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. _________________