Permutations combinatorics problem?

SMA_01
Messages
215
Reaction score
0

Homework Statement



A telephone extension has four digits, how many different extensions are there with no repeated digits, if the first digit cannot be zero?

Homework Equations



P(n,r)=n!/(n-r)!


The Attempt at a Solution



For the first digit, there are 9 possibilities (because no zero)
For the last 3 digits I used P(9,3)=9!/6!=9x8x7

So, in the end my result was: 9x9x8x7= 4,536 different extensions...

I'm just wondering if I was correct?
 
Physics news on Phys.org
SMA_01 said:

Homework Statement



A telephone extension has four digits, how many different extensions are there with no repeated digits, if the first digit cannot be zero?

Homework Equations



P(n,r)=n!/(n-r)!


The Attempt at a Solution



For the first digit, there are 9 possibilities (because no zero)
For the last 3 digits I used P(9,3)=9!/6!=9x8x7

So, in the end my result was: 9x9x8x7= 4,536 different extensions...

I'm just wondering if I was correct?

Seems fine to me.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top