Re: [CFRG] Combinitorics probabilities

Now how do I put this into excel (or OF calc)?  :)

On 8/8/22 17:36, David Jacobson wrote:
> I played with this in Mathematica and got this result
>
> (Beta[p, m, 1 - m + n] Gamma[1 + n])/(Gamma[m] Gamma[1 - m + n])    This assumes that m >= 1 && m <= n.
>
> And Beta(a, b) = (a-1)! * (b-1)!  /  (a+b-1)!
>
>
> Here is the Mathematica input that got me the result:
>
> Assuming[{x, m, n} \[Element] Integers && 0 < p < 1,
>   Probability[x >= m, x \[Distributed] BinomialDistribution[n, p]]]
>
>     —David Jacobson
>
>
>
>
>> On Aug 8, 2022, at 2:17 PM, Robert Moskowitz <rgm-sec@htt-consult.com> wrote:
>>
>>
>>
>> On 8/8/22 17:06, Taylor R Campbell wrote:
>>>> Date: Mon, 8 Aug 2022 16:58:45 -0400
>>>> From: Robert Moskowitz <rgm-sec@htt-consult.com>
>>>>
>>>> Well I spent the afternoon googling, but my search foo is weak.
>>>>
>>>> I want the formula for the probablity of receiving at least m out of n
>>>> messages given the probablity of receiving any message is p.
>>> This sounds like the coupon collector's problem?
>>>
>>> https://en.wikipedia.org/wiki/Coupon_collector%27s_problem
>> Close, but I can't map this to my problem in packet reception.
>>
>> _______________________________________________
>> CFRG mailing list
>> CFRG@irtf.org
>> https://www.irtf.org/mailman/listinfo/cfrg
>
> _______________________________________________
> CFRG mailing list
> CFRG@irtf.org
> https://www.irtf.org/mailman/listinfo/cfrg