1. Thanks for the explanation. I'm still not able to understand why at last you have multiplied by 5!
2. Also, I solved this question in the following way and got wrong. Can you pls explain where i lost my track or is my approach fundamentally wrong.
There are 5 digits, So _ _ _ _ _
There are 4 prime numbers between 0 to 9.
There are 6 non-prime numbers.
Having 2 prime numbers is a must.
Therefore by using fundamental counting principle and filling the above blanks.
4 3 6 5 4 (The first two numbers are filled with prime, remaining three are non prime)
Therefore, 4x3x6x5x4 = 1440.
Now, prime numbers can be arranged in the following.
P1 NP P2 NP NP - Keeping the first number in position, the second number can be swapped 4 times. Now, move the first number (P1) to second slot and keep rearranging second number (P2). So, you get 4x5 = 20 possibilities.
So, I thought 1440 x 20 = 28800.
P.S. Pls excuse if I got the logic terribly wrong.
Bunuel
Bunuel
Olive is creating a five-digit code using the digits 0 through 9. How many different codes can she create with exactly two prime digits if no digits can be repeated?
A. 252
B. 3,120
C. 3,456
D. 14,400
E. 30,240
The code will be any combination of the following: {P1} {P2} {X} {Y} {Z}, where P1 and P2 are prime digits, and X, Y and Z are other digits (all distinct).
There are four single-digit primes: 2, 3, 5, and 7 and six other digits: 0, 1, 4, 6, 8, and 9.
The number of pairs of primes, P1 and P2, out of four primes is 4C2 = 6;
The number of triplets of non-primes, X, Y and Z, our of six is 6C3 = 20.
Therefore, 6*20*5! = 14,400 (multiplying by 5! to account for different arrangements of 5 digits {P1} {P2} {X} {Y} {Z}).
Answer: D.