MHB Probability Challenge: Find Interval of Integers Drawn from Urn

lfdahl
Gold Member
MHB
Messages
747
Reaction score
0
An urn contains $n$ balls numbered $1, 2, . . . , n$. They are drawn one at a time at random until the urn is empty.
Find the probability that throughout this process the numbers on the balls which have been drawn is an interval of integers.
(That is, for $1 \leq k \leq n$, after the $k$th draw the smallest number drawn equals the largest drawn minus $k − 1$.)
 
Mathematics news on Phys.org
lfdahl said:
An urn contains $n$ balls numbered $1, 2, . . . , n$. They are drawn one at a time at random until the urn is empty.
Find the probability that throughout this process the numbers on the balls which have been drawn is an interval of integers.
(That is, for $1 \leq k \leq n$, after the $k$th draw the smallest number drawn equals the largest drawn minus $k − 1$.)
[sp]Call the process "allowable" if it satisfies that condition.

Suppose that the first ball drawn is numbered $r$. If the process is to be allowable then the number on each subsequent ball drawn must be next to either the lower end ($L$) or the upper end ($U$) of the existing consecutive run of integers. There are $n-1$ more balls to be drawn, so the process is completely specified by a string of $n-1$ letters $L$ and $U$. Also, there are exactly $r-1$ numbers less than $r$, so the string must contain $r-1$ $L$s (and $n-r$ $U$s). The number of such strings is $$n-1\choose r-1$$. Therefore there are $$n-1\choose r-1$$ allowable processes starting with $r$. So the total number of allowable processes is $$\sum_{r=1}^n{n-1\choose r-1} = 2^{n-1}.$$ The number of all ways of drawing the balls from the urn is $n!$. Therefore the probability of a process being allowable is $\dfrac{2^{n-1}}{n!}.$

[/sp]
 
Opalg said:
[sp]Call the process "allowable" if it satisfies that condition.

Suppose that the first ball drawn is numbered $r$. If the process is to be allowable then the number on each subsequent ball drawn must be next to either the lower end ($L$) or the upper end ($U$) of the existing consecutive run of integers. There are $n-1$ more balls to be drawn, so the process is completely specified by a string of $n-1$ letters $L$ and $U$. Also, there are exactly $r-1$ numbers less than $r$, so the string must contain $r-1$ $L$s (and $n-r$ $U$s). The number of such strings is $$n-1\choose r-1$$. Therefore there are $$n-1\choose r-1$$ allowable processes starting with $r$. So the total number of allowable processes is $$\sum_{r=1}^n{n-1\choose r-1} = 2^{n-1}.$$ The number of all ways of drawing the balls from the urn is $n!$. Therefore the probability of a process being allowable is $\dfrac{2^{n-1}}{n!}.$

[/sp]

Awesome - thankyou for your participation, Opalg!
 
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