MHB Calculation of probability with arithmetic mean of the sum of random variables

pizzico85
Messages
6
Reaction score
0
Calculation of probability with arithmetic mean of random variables

There are 4 people, each of whom has one deck of cards with 500 cards that are numbered from 1 to 500 with no duplicates.

Each person draws a card from his deck and I would like to calculate the probability of the event that "the arithmetic mean of the number on the 4 cards is 405".

How to make that?Some explanation is welcome.
 
Last edited:
Mathematics news on Phys.org
pizzico85 said:
There are 4 people, each of whom has one deck of cards with 500 cards that are numbered from 1 to 500 with no duplicates.

Each person draws a card from his deck and I would like to calculate the probability of the event that "the arithmetic mean of the sum of the number on the 4 cards is 405".

How to make that?Some explanation is welcome.

Hi pizzico85, welcome to MHB! ;)

It's an application of the Stars and Bars theorem.
It's explained in detail here: Stars and Bars theorem
They explain it better - and with pictures - than I can.

More specifically, you have:
$$\begin{align*}P(\text{arithmetic mean is 405})&=P(X_1+X_2+X_3+X_4=4\cdot 405) \\
&=\frac{\text{Number of ways that }X_1+X_2+X_3+X_4=1620}{500^4} \\
&= \frac 1{500^4}\binom{1620-1}{4-1} \\
&\approx 0.011
\end{align*}$$
 
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