You are not logged in.
Post a reply
Topic review (newest first)
- bobbym
- 2012-12-04 23:51:16
Hi;
Basically, you are just plugging into formulas, check post #5 again.
- Jhua4
- 2012-12-04 23:44:34
bobbym wrote:
Hi;
Post #5 contains all the answers you require.
I see the solutions but could you also post how you got to the solution?
- bobbym
- 2012-12-04 23:35:32
Hi;
Post #5 contains all the answers you require.
- Jhua4
- 2012-12-04 23:25:29
Sorry I meant the following:
The cards are identical and no envelope can be left empty
- bobbym
- 2012-12-04 23:21:21
Hi;
Please hold on I am getting the answers to the problems. I am putting them in post #5. When I have all the computation done, I will explain the methods.
c) cards are identical and no card can be left empty
This question is incorrect.
- Jhua4
- 2012-12-04 23:14:38
Could you explain how you got to that solution please? Thanks!
- bobbym
- 2012-12-04 22:55:52
Hi;
Non negative means 0,1,2,3,4,5 so some boxes can be empty.
a)
ways.
b)
ways.
c)
ways.
- Jhua4
- 2012-12-04 22:46:46
So what exactly is the correct answer for a)? Thanks!
- bobbym
- 2012-12-04 22:42:04
Thats for n1, n2, n3 number of cards in each each envelope..
My formula has some envelopes empty so it is not correct.
- Jhua4
- 2012-12-04 22:31:02
We have learned the following formula for putting distinguishable objects into distinguishable boxes: n!/n1!n2!...nk!
So I'm a little confused as how to apply that formula to the question.
- Jhua4
- 2012-12-04 22:15:31
You have 25 cards, 15 distinguishable envelopes (i.e. envelopes are labeled 1,2,3...,15). You may put any non-negative number of cards into an envelope. In how many ways can you put the 25 cards if
a) the cards are distinguishable (e.g., if each has different message on it)
b) cards are identical
c) cards are identical and no card can be left empty
I can't figure out the answers for this problem. Help is much appreciated!