Homework Help: Permutation with restriction

1. Apr 14, 2014

iwan89

1. The problem statement, all variables and given/known data

A security code is formed by using three alphabet and four digits chosen from alphabet {a,b,c,d,e} and digits {1,2,3,4,5,6}. All digits and alphabets can only be used once. Find the number of different ways the security code can be formed if
(a) there is no restriction imposed (Answer :756000)
(b) It consists of at least two consonant (Answer: 529200)

2. Relevant equations
I used Permutation with restriction

3. The attempt at a solution
i tried the following. Im not sure whether the working is correct or not..

(a) 5P3(for alphabet) x 6P4(for digit) =21600.. but this seems wrong because my computation is based on the alphabet and digits must be togather

(b) I have no idea at all. I really need the idea from the first question :(

2. Apr 14, 2014

jbunniii

First, calculate how many ways there are to choose the letters and numbers. How many combinations are there if you choose three letters and four numbers without repetition?

Then, calculate how many ways there are to arrange each combination.

3. Apr 14, 2014

iwan89

why i cant use 5P3 x 6P4? you mean i should use C?

4. Apr 14, 2014

jbunniii

Because that would give you the number of permutations of the form abc1234 or bec3462, where the letters come before the numbers. It would not include permutations like 12ab34c.

5. Apr 14, 2014

iwan89

You mean 5C3 x6C4?

6. Apr 14, 2014

jbunniii

That gives you the number of ways to choose 3 distinct letters and 4 distinct numbers. Now given a particular choice, how many ways are there to rearrange those letters and numbers?

7. Apr 14, 2014

iwan89

supposely letter has 5P3 and numbers has 6P4 but as a whole i dont know how to compute it

8. Apr 14, 2014

jbunniii

How many ways can you rearrange 7 objects?

9. Apr 14, 2014

iwan89

Got it thanks!