Prev: Toward a grand theory of irreversibility
Next: Sparse matrix profile reduction
From: Ray Vickson on 7 Jun 2010 12:06
On Jun 7, 4:35 am, ziyuang <ziyu...(a)gmail.com> wrote:
> Hi, there. Here is my question:
>
> Given n balls numbered 1 to n and choose m balls from them, then what
> is the probability of existing k balls with consecutive numbers in
> those m balls?

Do you mean 'exactly k' or 'at least k'? For example, if k = 2, does
the sequence "123" count or not?

R.G. Vickson

>
> Thank you~

From: ziyuang on 9 Jun 2010 13:58
On Jun 8, 12:06 am, Ray Vickson <RGVick...(a)shaw.ca> wrote:
> On Jun 7, 4:35 am, ziyuang <ziyu...(a)gmail.com> wrote:
>
> > Hi, there. Here is my question:
>
> > Given n balls numbered 1 to n and choose m balls from them, then what
> > is the probability of existing k balls with consecutive numbers in
> > those m balls?
>
> Do you mean 'exactly k' or 'at least k'? For example, if k = 2, does
> the sequence "123" count or not?
>
> R.G. Vickson
>
>
>
>
>
> > Thank you~

Thank you, R.G. Vickson.
Sorry for the duplicate post, and I am meaning "at least".
Please refer to this thread:
http://groups.google.com/group/sci.math/browse_thread/thread/56a426810dcaebe3/58c6ff8f493eda82#58c6ff8f493eda82
Thanks~
 | 
Pages: 1
Prev: Toward a grand theory of irreversibility
Next: Sparse matrix profile reduction