1 / 9

A marbles game Changqing Li

A marbles game Changqing Li .

keefe
Download Presentation

A marbles game Changqing Li

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A marbles game Changqing Li

  2. A marble falls into the container. When the marble crashes the barrier in the first row, then the marble falls into the second row. When it crashes the barriers in the second row, then it falls into the third row. In this way, the marble finally down to the bottom of the container. According to the area of marble, we can win a different prize. The prize of A and G is the best, and the prize of D is the worst. The prize of A is much better than D. This can tell us that the probability of A is much better than D.

  3. Analysis for Region D

  4. We can analyses the situation of D. The marble falls into the D has two situations: one is from the upper left and another is from upper right. So the probability of D is half of the sum of these two probabilities. Then we can get probabilities for every region.

  5. Probability for every region

  6. From the result, we can easily find out that the numerator of every probability is the same as the every entry of Pascal’s Triangle.

  7. So we can easily know that the probability of A is much greater than D according to some properties of Pascal’s Triangle. If we have 1 + C1,n + C2,n +…+ Cn-2,n +Cn-1,n +1 marbles. Then make them fall into the container and down to the n+1 regions. And the number of marbles from left to right in each region is 1; C1,n ; C2,n ;…+ Cn-2,n ;Cn-1,n ;1 This is same as the entries of (n+1)th rows in Pascal’s Triangle.

  8. http://www.youtube.com/watch?v=nOenO-JLD5w

More Related