query: How can I calculate the combinations of having exactly k distinct letters in a word of length n?
positive_passages.docid: 142477
positive_passages.text: Closed-form expression for the number of $k$-permutations of length $n$. Duplicates allowed!
negative_passages.docid: 70761
negative_passages.text: Number of ways to connect sets of $k$ dots in a perfect $n$-gon
negative_passages.docid: 131863
negative_passages.text: Permutation question on alphabets
negative_passages.docid: 70282
negative_passages.text: Help finding a combinatorial proof of $k {n \choose k } = n {n - 1 \choose k -1}$
negative_passages.docid: 30575
negative_passages.text: How to precalculate valid number of combinations instead of using while loop?
negative_passages.docid: 271
negative_passages.text: How to get all possible combinations of a list’s elements?
negative_passages.docid: 74730
negative_passages.text: Combinatorial Proof of ${{n}\choose{k}} {{k}\choose{j}} = {{n}\choose{j}} {{n-j}\choose{k-j}}$
negative_passages.docid: 26619
negative_passages.text: Permutations of word 'mathematics'
negative_passages.docid: 58749
negative_passages.text: Choose K items from N in a circle
negative_passages.docid: 65763
negative_passages.text: Number of ways to write n as a sum of k nonnegative integers
negative_passages.docid: 48838
negative_passages.text: Proving the number of $n$ length binary strings with no consecutive $1's$ $b_n$ is equal to $b_{n-1} + b_{n-2}$
negative_passages.docid: 111379
negative_passages.text: Creating all possible k combinations of n items in C++
negative_passages.docid: 103538
negative_passages.text: Partitions of $n$ into distinct odd and even parts proof
negative_passages.docid: 130614
negative_passages.text: Permutations on word $MISSISSIPPI$.
negative_passages.docid: 38037
negative_passages.text: A problem with my reasoning in a problem about combinations
negative_passages.docid: 75223
negative_passages.text: Generate all possible permutations (or n-tuples)
negative_passages.docid: 35648
negative_passages.text: How many permutations of the set n={1,2,3,3,3,4,4,5} are possible without any consecutive identical elements?