How many ways can prizes be distributed among lottery finalists?

  • Thread starter Thread starter eku_girl83
  • Start date Start date
  • Tags Tags
    Counting
eku_girl83
Messages
89
Reaction score
0
Here are my problems:
1) Suppose seven school children (3 girls and 4 boys) are lined up to board a school bus. Find the number of ways they could line up if no two boys are together.
This arrangement would be BGBGBGB. So if I consider each BG as a unit, then there are 4! arrangements. But within the BG groupings, the B and G can switch places. So shouldn't the number of ways be 4!2!2!2! Is this correct?

2) Among ten lottery finalists, four will be selected to win individual amounts of $1000, 2000, 5000, and 10000. In how many ways can the money be distributed?

I know that 10 choose 4 is 210. But don't I have to do something else? A permutation perhaps?

Thanks for the help in advance!
 
Physics news on Phys.org
1.
Because of the way the problem is stated, you can't have the boys and girls change places or you'd have two boys together.
You also forgot that the girls can switch with each other.

2.
Can one person win more than one amount of money?

How many different people can win the $1000 prize ? After someone wins $1000, how many people can win $2000, after those two prizes have been awarded, how many different people can win $5000 ? After the other three prizes have been given out, how many choices are there for the $10000 winner?
 
BGBGBGB is the only possible way to separate them. Send all 4 boys to one spot and all three girls to another. Then the teacher can fill the arranged slots by chosing from the boys in 4! ways and from the girls in 3! ways, so that is 144 ways.

In the second problem there are 10C4 = 210 ways of chosing 4 from 10, but those four can be arranged in 4! ways, so that is 5040 ways.

Or if you'd rather just consider it a permutation problem, there are 10 ways to chose the first prize person, 9 for the second, up to the 4th. So that is the permutation:

\frac{10!}{6!}=5040
 
Last edited:
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top