Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How is this called:

$$\frac{3!}{2!} + \frac{3!}{1!} + \frac{3!}{0!} = 15$$

For example with a,b,c it would be:

a,ab,ac,abc,acb,

b,ba,bc,bac,bca,

c,ca,cb,cab,cba

share|improve this question
2  
I would call it "how many nonempty strings can be made from the letters $\{a,b,c\}$ without using any letter more than once". –  Henning Makholm Jan 3 '12 at 0:19
    
Are you referring to permutation? –  Sniper Clown Jan 3 '12 at 0:23

2 Answers 2

up vote 4 down vote accepted

You might be prepared to extend it to 3!/3! + 3!/2! + 3!/1! + 3!/0! = 16 to include the case where you have an empty ordered subset.

More generally for positive $n$ $$\sum_{k=0}^n \frac{n!}{k!} = \lfloor n! \times e \rfloor.$$

OEIS A000522 and A007526 suggest these are called "arrangements", but centuries ago were called "variations".

share|improve this answer
    
+1 for references. –  matt Jan 3 '12 at 2:51

It sounds like you're referring to counting.

$\sum_{k=1}^n \frac{n!}{k!}$ tells you the number of nonempty tuples obtainable from a set of size $n$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.