**different** articles.
The names of the types are - \(A_1,A_2,A_3,...,A_n\)
Number of article \(A_1\) is \(N_1\) , \(A_2\) is \(B_2\)... same goes upto \(A_n\).
We have to **choose** k articles.Repetition is allowed.

No vote yet

3 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestCan't understand

Log in to reply

Comment deleted Feb 22, 2013

Log in to reply

I think that formula can only be used when we are permuting all the objects given. When there is a limit of k objects as imposed in the question, I don't think it can be used. The answer will not be right.

That having been said, we can apply the Multinomial Theorem to find the answer. A question based on this Theorem is posted here. https://brilliant.org/discussions/thread/integer-partitions/

Log in to reply

Can you show the steps?

Log in to reply

This link has a specific case of the question you have asked. In this case, when you have to create a limited length word, you cannot use the Mississippi formula. On Yahoo Answers, the asker says that the Mississippi formula does not work. The answer given will not be easy to derive for a specific case. The Multinomial Theorem works better there. I will upload a detailed solution soon.

Log in to reply

Log in to reply

Log in to reply

Log in to reply

discussion at

Sure, will create one now. // Created a newLog in to reply