It is currently 24 Nov 2017, 06:39

### GMAT Club Daily Prep

#### 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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# If k is a positive integer, then 20k is divisible by how man

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Intern
Joined: 20 Aug 2013
Posts: 11

Kudos [?]: 20 [2], given: 3

Location: United States
Concentration: Marketing, Strategy
GMAT 1: 720 Q38 V41
WE: Project Management (Consulting)
If k is a positive integer, then 20k is divisible by how man [#permalink]

### Show Tags

22 Aug 2013, 04:14
2
This post received
KUDOS
13
This post was
BOOKMARKED
00:00

Difficulty:

45% (medium)

Question Stats:

59% (00:36) correct 41% (00:28) wrong based on 554 sessions

### HideShow timer Statistics

If k is a positive integer, then 20k is divisible by how many different positive integers?

(1) k is prime
(2) k = 7

[Reveal] Spoiler:
Divisible by a positive integer -> factor
No of factors for a number in the form (a^x)(b^y)(c^z) is given by (x+1)(y+1)(z+1)

20k = (2^2)(5^1)(k)

Stmt 1 says k is prime. so 20k = (2^2)(5^1)(k^1). Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Stmy 2 says k = 7 so again Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Hence answer is D, but that is not the OA. What am I missing?
[Reveal] Spoiler: OA

Last edited by Bunuel on 22 Aug 2013, 04:17, edited 1 time in total.
Edited the question.

Kudos [?]: 20 [2], given: 3

Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 627

Kudos [?]: 1390 [5], given: 136

Re: If k is a positive integer, then 20k is divisible by [#permalink]

### Show Tags

22 Aug 2013, 04:21
5
This post received
KUDOS
2
This post was
BOOKMARKED
spjmanoli wrote:
If k is a positive integer, then 20k is divisible by how many different positive integers?
1. k is prime
2. k is 7

Divisible by a positive integer -> factor
No of factors for a number in the form (a^x)(b^y)(c^z) is given by (x+1)(y+1)(z+1)

20k = (2^2)(5^1)(k)

Stmt 1 says k is prime. so 20k = (2^2)(5^1)(k^1). Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Stmy 2 says k = 7 so again Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Hence answer is D, but that is not the OA. What am I missing?

What you are missing in F.S 1, is that we don't know the value of k.

Scenario I: k=2, the total no of factors for 20k = $$2^2*5*2 = 2^3*5 = (3+1)*(1+1) = 8$$

Scenario II: k=3, the total no of factors for 20k = $$2^2*5*3 = (2+1)*(1+1)*(1+1) = 12.$$
Hence, 2 different answers, thus, Insufficient.
_________________

Kudos [?]: 1390 [5], given: 136

Math Expert
Joined: 02 Sep 2009
Posts: 42356

Kudos [?]: 133204 [2], given: 12439

Re: If k is a positive integer, then 20k is divisible by how man [#permalink]

### Show Tags

22 Aug 2013, 04:21
2
This post received
KUDOS
Expert's post
17
This post was
BOOKMARKED
spjmanoli wrote:
If k is a positive integer, then 20k is divisible by how many different positive integers?

(1) k is prime
(2) k = 7

[Reveal] Spoiler:
Divisible by a positive integer -> factor
No of factors for a number in the form (a^x)(b^y)(c^z) is given by (x+1)(y+1)(z+1)

20k = (2^2)(5^1)(k)

Stmt 1 says k is prime. so 20k = (2^2)(5^1)(k^1). Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Stmy 2 says k = 7 so again Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Hence answer is D, but that is not the OA. What am I missing?

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:

If k is a positive integer, then 20k is divisible by how many different positive integers?

$$20k=2^2*5*k$$.

(1) k is prime. If $$k=2$$, then $$20k=2^3*5$$ --> the # of factors = $$(3+1)(1+1)=8$$ but if $$k=5$$, then $$20k=2^2*5^2$$ --> the # of factors = $$(2+1)(2+1)=9$$. Not sufficient.

(2) k = 7 --> $$20k=2^2*5*7$$ --> the # of factors = $$(2+1)(1+1)(1+1)=12$$. Sufficient.

Answer: B.

Hope it's clear.
_________________

Kudos [?]: 133204 [2], given: 12439

Intern
Joined: 18 Jan 2016
Posts: 23

Kudos [?]: 2 [0], given: 7

Re: If k is a positive integer, then 20k is divisible by how man [#permalink]

### Show Tags

24 Feb 2016, 11:43
Bunuel wrote:
Back to the original question:

If k is a positive integer, then 20k is divisible by how many different positive integers?

$$20k=2^2*5*k$$.

(1) k is prime. If $$k=2$$, then $$20k=2^3*5$$ --> the # of factors = $$(3+1)(1+1)=8$$ but if $$k=5$$, then $$20k=2^2*5^2$$ --> the # of factors = $$(2+1)(2+1)=9$$. Not sufficient.

(2) k = 7 --> $$20k=2^2*5*7$$ --> the # of factors = $$(2+1)(1+1)(1+1)=12$$. Sufficient.

Answer: B.

Hope it's clear.

Thanks, the outcome is clear but this method of picking random numbers to test with makes me very uneasy. If you get lucky and the 2 numbers you pick yield different results, then all is fine. But if they yield the same result, you don't know anything. Do you pick a 3rd candidate? A 4th?

Kudos [?]: 2 [0], given: 7

Retired Moderator
Joined: 12 Aug 2015
Posts: 2213

Kudos [?]: 881 [0], given: 602

Re: If k is a positive integer, then 20k is divisible by how man [#permalink]

### Show Tags

14 Mar 2016, 00:09
Here Statement ! is not sufficient as the prime may be 2 or 5 or any other prime.
But statement 2 is sufficient as we Number of divisors now = 2*3*2= 12
Hence B
_________________

Give me a hell yeah ...!!!!!

Kudos [?]: 881 [0], given: 602

Director
Joined: 12 Nov 2016
Posts: 794

Kudos [?]: 37 [0], given: 165

Re: If k is a positive integer, then 20k is divisible by how man [#permalink]

### Show Tags

25 Jul 2017, 15:41
hellzangl wrote:
If k is a positive integer, then 20k is divisible by how many different positive integers?

(1) k is prime
(2) k = 7

[Reveal] Spoiler:
Divisible by a positive integer -> factor
No of factors for a number in the form (a^x)(b^y)(c^z) is given by (x+1)(y+1)(z+1)

20k = (2^2)(5^1)(k)

Stmt 1 says k is prime. so 20k = (2^2)(5^1)(k^1). Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Stmy 2 says k = 7 so again Total # of factors is (2+1)(1+1)(1+1). So sufficient.

Hence answer is D, but that is not the OA. What am I missing?

Very simple, no tricks here or anything. If we know the value of K then we obviously know the answer- though in the case of K being a prime number- what if K is 2? Then there is of course some overlap- do not forget 2 is a prime number.

K= 5 x 2 x 2 x (2 x 1)

Thus
B

Kudos [?]: 37 [0], given: 165

Re: If k is a positive integer, then 20k is divisible by how man   [#permalink] 25 Jul 2017, 15:41
Display posts from previous: Sort by

# If k is a positive integer, then 20k is divisible by how man

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.