- #1
zeion
- 466
- 1
Homework Statement
Hello.
This is the gist of the question:
I have 0 < k < n and I need a formula to show the number of sets of exactly k integers, each chosen from 1, ... , n.
Homework Equations
n! is the number of distinct ways to rearrange n objects into n slots.
The Attempt at a Solution
Basically I need to fit n different objects into k slots. So there are more objects to choose from than slots. So the number of distinct ways to fit n objects into k slots is given by n(n-1) ... (n-k+1).
The solution says I have to divide by k! but I don't understand why.