MHB What Is the Probability of Receiving Identical Pairs from Random Crates?

  • Thread starter Thread starter ZooJersey
  • Start date Start date
  • Tags Tags
    Probability
ZooJersey
Messages
1
Reaction score
0
A friend stated they bought 16 crates all which could contain a random C1-C8 item. He then opened the crates and received exactly 2 each of every C1-C8 items.

So, (C1,C1) (C2,C2) (C3,C3) (C4,C4) (C5,C5) (C6,C6) (C7,C7) (C8,C8) is what he ended up with.

He stated this was good because there was an equal chance of getting them. I thought that this was highly unusual, and suggested there was no randomness since he received two of every possible item.

That brings me to the title question. What is the probability of receiving 8 pairs of identical boxes choosing from 8 items 16 times?

I thought it would be 12.5% for drawing a single item and 1.5% of matching a box then [(1.5%)(1.5%)]16 for getting two of all 8.

Any help would be appreciated.

Thank you
 
Mathematics news on Phys.org
The probability of getting an item is 1. The probability of getting that same item is 1/8. The probability of then getting another item is 7/8. The probability of getting that same item is 1/8.

Continuing like that the probability of getting 8 items, each twice, is 1(1/8)(7/8)(1/8)(6/8)(1/8)(5/8)(1/8)(4/8)(1/8)(3/8)(1/8)(2/8)(1/8)(1/8)(1/8)= 7!/8^{15}. That is approximately [FONT=Verdana,Arial,Tahoma,Calibri,Geneva,sans-serif]1.432454 x 10^{-10}[FONT=Verdana,Arial,Tahoma,Calibri,Geneva,sans-serif].

[FONT=Verdana,Arial,Tahoma,Calibri,Geneva,sans-serif]
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top