## Combinatorics

1. The problem statement, all variables and given/known data
There is a word given:
"RAKSH"
and n slips are provided. A person is free to write any one of the letters (R,A,K,S,H) in each of the slips. Repetition is allowed, i.e. for eg. one such case would be that all the 'n' slips are filled with the letter "R'.

First we groups of 1 slip from n
then groups of 2 slips from n
then groups of3
4,5,6,7......n.

Find the number of such groups formed that contain at least one of each of the letters, i.e. R,A,K,S,H!

3. The attempt at a solution

I was told that its a difficult question. Here is what I think:
it is obvious that groups of 1 to 4 members are useless. since there are 5 letters in RAKSH.

First I consider those cases in which at least one of each letter is there:
5 slips have been fixed as RAKSH. and there are remaining n-5 slips , each have 5 options to get filled with.
help me!
 PhysOrg.com science news on PhysOrg.com >> Ants and carnivorous plants conspire for mutualistic feeding>> Forecast for Titan: Wild weather could be ahead>> Researchers stitch defects into the world's thinnest semiconductor
 Recognitions: Science Advisor The statement of the problem is not completely clear to me. Is this correct? There are n slips of paper. Each slip is printed with a letter. For each slip, the letter has been selected at random, with equal probability, from a list of five letters. We now choose k slips at random. What is the probability that each of the five letters occurs at least once?

 Quote by Avodyne The statement of the problem is not completely clear to me. Is this correct? There are n slips of paper. Each slip is printed with a letter. For each slip, the letter has been selected at random, with equal probability, from a list of five letters. We now choose k slips at random. What is the probability that each of the five letters occurs at least once?
Yup!!

## Combinatorics

I am waiting for some help!!
 Recognitions: Science Advisor Well, if that's the setup, then the total number n of slips doesn't matter. Each of the k slips is equally likely to have any letter on it. Can you write down the probability that there are exactly n_R slips with R, n_A slips with A, etc?

 Quote by Avodyne Well, if that's the setup, then the total number n of slips doesn't matter. Each of the k slips is equally likely to have any letter on it. Can you write down the probability that there are exactly n_R slips with R, n_A slips with A, etc?
I am studying Permutation an Combination. I havent yet studied probability.