GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 22 Oct 2019, 09:18

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

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

# How many 4 digit codes can be made, if each code can only contain

Author Message
TAGS:

### Hide Tags

Intern
Joined: 01 Sep 2010
Posts: 19
How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

Updated on: 09 May 2017, 08:48
5
11
00:00

Difficulty:

95% (hard)

Question Stats:

42% (03:09) correct 58% (02:24) wrong based on 117 sessions

### HideShow timer Statistics

How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Thank you all for the help and detailed explanations (especially you - Bunuel).

Originally posted by eladshush on 04 Oct 2010, 07:00.
Last edited by Bunuel on 09 May 2017, 08:48, edited 2 times in total.
RENAMED THE TOPIC.
Math Expert
Joined: 02 Sep 2009
Posts: 58422
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

04 Oct 2010, 08:41
4
3
Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Please consider the following problem that I am not sure I understood:

How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Thank you all for the help and detailed explanations (especially you - Bunuel).

The question is a little bit ambiguous but I think it means the following:

I guess as it's not mentioned primes can be repeated.

There are:
4 one digit primes (O) less than 20 - 2, 3, 5, 7;
4 two digit primes (T) less than 20 - 11, 13, 17, 19;

Thus 4-digit number could be of the following type:

OOOO, for example: 2|3|5|7 or 2|2|7|7. Each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4^4$$;

TT, for example: 11|11 or 19|17. Each T can take 4 values from {11, 13, 17, 19}, so total ways for this type is $$4^2$$;

TOO, for example: 11|3|5 or 19|7|2. T can take 4 values from {11, 13, 17, 19} and each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4*4^2=4^3$$;
OTO, for example: 2|13|5 or 7|19|2. The same as above: $$4^3$$;
OOT, for example: 2|5|19 or 7|2|17. The same as above: $$4^3$$;

Total: $$4^4+4^2+3*4^3=464$$.

_________________
##### General Discussion
Retired Moderator
Joined: 02 Sep 2010
Posts: 724
Location: London
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

04 Oct 2010, 08:45
2
Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Please consider the following problem that I am not sure I understood:

How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Thank you all for the help and detailed explanations (especially you - Bunuel).

First note all the single digit primes {2,3,5,7}
And then all the 2-digit ones {11,13,17,19}

Case 1
Codes formed with 2 two digit primes
(2-digit prime) (2-digit prime)
No of ways = 4x4 = 16

Case 2
Codes formed with 4 one digit primes
(1-digit prime) (1-digit prime) (1-digit prime) (1-digit prime)
No of ways = 4x4x4x4 = 256

Case 3
Codes formed with 2 one-digit primes and 1 two-digit prime
(1-digit prime) (1-digit prime) (2-digit prime)
(1-digit prime) (2-digit prime) (1-digit prime)
(2-digit prime) (1-digit prime) (1-digit prime)
Each set can be formed in 4x4x4 ways
So total = 3x64 = 192

Total number = 192+256+16 = 464

PS : Some others also deserve thanks
_________________
Manager
Joined: 27 Mar 2010
Posts: 77
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

05 Oct 2010, 13:33
Bunuel wrote:
Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Please consider the following problem that I am not sure I understood:

How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Thank you all for the help and detailed explanations (especially you - Bunuel).

The question is a little bit ambiguous but I think it means the following:

I guess as it's not mentioned primes can be repeated.

There are:
4 one digit primes (O) less than 20 - 2, 3, 5, 7;
4 two digit primes (T) less than 20 - 11, 13, 17, 19;

Thus 4-digit number could be of the following type:

OOOO, for example: 2|3|5|7 or 2|2|7|7. Each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4^4$$;

TT, for example: 11|11 or 19|17. Each T can take 4 values from {11, 13, 17, 19}, so total ways for this type is $$4^2$$;

TOO, for example: 11|3|5 or 19|7|2. T can take 4 values from {11, 13, 17, 19} and each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4*4^2=4^3$$;
OTO, for example: 2|13|5 or 7|19|2. The same as above: $$4^3$$;
OOT, for example: 2|5|19 or 7|2|17. The same as above: $$4^3$$;

Total: $$4^4+4^2+3*4^3=464$$.

Hi Bunuel,

why can't i write TOO,OTO,OOT AS

(4^3)*3! , taking the T as one entity ans assuming that 3 things can be arranged in 3! ways???
Math Expert
Joined: 02 Sep 2009
Posts: 58422
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

05 Oct 2010, 13:37
utin wrote:
Hi Bunuel,

why can't i write TOO,OTO,OOT AS

(4^3)*3! , taking the T as one entity ans assuming that 3 things can be arranged in 3! ways???

Just one thing: TOO can be arranged in 3!/2! ways and not in 3! (# of permutations of 3 letters out which 2 O's are identical is 3!/2!), so it would be $$4^3*\frac{3!}{2!}=4^3*3$$.

Hope it's clear.
_________________
Manager
Joined: 27 Mar 2010
Posts: 77
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

05 Oct 2010, 13:53
Bunuel wrote:
utin wrote:
Hi Bunuel,

why can't i write TOO,OTO,OOT AS

(4^3)*3! , taking the T as one entity ans assuming that 3 things can be arranged in 3! ways???

Just one thing: TOO can be arranged in 3!/2! ways and not in 3! (# of permutations of 3 letters out which 2 O's are identical is 3!/2!), so it would be $$4^3*\frac{3!}{2!}=4^3*3$$.

Hope it's clear.

I though about the same but but when i see that TOO as three things to be arranged in 3! ways then i also thought that OO ARE TWO DIGITS AND THEY ARE TWO DIFFERENT PRIME NOS SO WHY DIVIDE BY 2!

this might clear my entire probability confusion i hope...
Math Expert
Joined: 02 Sep 2009
Posts: 58422
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

05 Oct 2010, 14:01
1
utin wrote:
Bunuel wrote:
utin wrote:
Hi Bunuel,

why can't i write TOO,OTO,OOT AS

(4^3)*3! , taking the T as one entity ans assuming that 3 things can be arranged in 3! ways???

Just one thing: TOO can be arranged in 3!/2! ways and not in 3! (# of permutations of 3 letters out which 2 O's are identical is 3!/2!), so it would be $$4^3*\frac{3!}{2!}=4^3*3$$.

Hope it's clear.

I though about the same but but when i see that TOO as three things to be arranged in 3! ways then i also thought that OO ARE TWO DIGITS AND THEY ARE TWO DIFFERENT PRIME NOS SO WHY DIVIDE BY 2!

this might clear my entire probability confusion i hope...

First of all two 1-digit primes can be the same, but it's not important here.

We are counting # of ways 4-digit number can be formed with two 1-digit primes and one 2-digit prime:
{1-digit}{1-digit}{2-digit}
{1-digit}{2-digit}{1-digit}
{2-digit}{1-digit}{1-digit}

Total 3 ways.
_________________
Manager
Joined: 27 Mar 2010
Posts: 77
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

05 Oct 2010, 14:59
Thanks Bunuel... +1 ... u already have many I knw
Director
Joined: 13 Mar 2017
Posts: 728
Location: India
Concentration: General Management, Entrepreneurship
GPA: 3.8
WE: Engineering (Energy and Utilities)
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

03 Oct 2017, 00:09
1
How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Thank you all for the help and detailed explanations (especially you - Bunuel).

Though the question is little bit confusing, but conceptually this question is a real gem. More details should have been provided about the restrictions on selection of digits.

So, there are 4 one digit prime numbers to be used they are {2,3,5,7}. Lets call the single digits as O
& there are 4 2-digit prime numbers to be used they are {11, 13, 15, 17}. And double digits as T.

Now there are 3 ways of selecting digits.

Case 1: All one digit prime numbers OOOO
No. of codes = 4^4 (since repetition of digit is allowed = 256

Case 2: 2 Two digit prime numbers TT
No. of codes = 4*4 = 16

Case 3 : one two digit prime number & 2 one digit prime number : OOT, OTO, TOO
No. of codes = 4*4*4 + 4*4*4 + 4*4*4 = 3*4^3 = 192

Total no. of codes = 256 + 16 + 192 = 464

_________________
CAT 2017 (98.95) & 2018 (98.91) : 99th percentiler
UPSC Aspirants : Get my app UPSC Important News Reader from Play store.

MBA Social Network : WebMaggu

Appreciate by Clicking +1 Kudos ( Lets be more generous friends.)

What I believe is : "Nothing is Impossible, Even Impossible says I'm Possible" : "Stay Hungry, Stay Foolish".
Senior Manager
Status: love the club...
Joined: 24 Mar 2015
Posts: 269
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

25 Dec 2017, 06:59
Bunuel wrote:
Hi all,

As you saw, I have published a bunch of questions in the past hour. Most of these questions are taken from a collection of hard quantitative questions provided by The Princeton Review (a.k.a - Killer Math).

I have posted any question that I have solved incorrectly, either due to careless error or concept error, in order to share them with everyone here.

Please consider the following problem that I am not sure I understood:

How many 4 digit codes can be made, if each code can only contain prime numbers that are less than 20?

A. 24
B. 102
C. 464
D. 656
E. 5040

Thank you all for the help and detailed explanations (especially you - Bunuel).

The question is a little bit ambiguous but I think it means the following:

I guess as it's not mentioned primes can be repeated.

There are:
4 one digit primes (O) less than 20 - 2, 3, 5, 7;
4 two digit primes (T) less than 20 - 11, 13, 17, 19;

Thus 4-digit number could be of the following type:

OOOO, for example: 2|3|5|7 or 2|2|7|7. Each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4^4$$;

TT, for example: 11|11 or 19|17. Each T can take 4 values from {11, 13, 17, 19}, so total ways for this type is $$4^2$$;

TOO, for example: 11|3|5 or 19|7|2. T can take 4 values from {11, 13, 17, 19} and each O can take 4 values from {2, 3, 5, 7}, so total ways for this type is $$4*4^2=4^3$$;
OTO, for example: 2|13|5 or 7|19|2. The same as above: $$4^3$$;
OOT, for example: 2|5|19 or 7|2|17. The same as above: $$4^3$$;

Total: $$4^4+4^2+3*4^3=464$$.

great solution as always, man
Non-Human User
Joined: 09 Sep 2013
Posts: 13406
Re: How many 4 digit codes can be made, if each code can only contain  [#permalink]

### Show Tags

13 Jan 2019, 19:00
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.
_________________
Re: How many 4 digit codes can be made, if each code can only contain   [#permalink] 13 Jan 2019, 19:00
Display posts from previous: Sort by