Re^2: recursive formula.

You forget that r_0 is always zero, so

P(1, 1, 1) = (1 - 1) P(1, 1) + (1 - 1) P(1, 1) + (1 - 0) P(1, 1)
           = P(1, 1) = P(1) = 1
[download]

Ron Steinke rsteinke@w-link.net

Comment on Re^2: recursive formula. Download Code

Replies are listed 'Best First'.
Re^3: recursive formula. by BrowserUk (Patriarch) on Aug 07, 2004 at 05:34 UTC
Thanks. That's the source of my misunderstanding. I saw the r₀ = 0 reference, but I also saw r running 1 .. n and i running 1 to n. I missed that n-i = 0 whenever n=i. Stupid. Examine what is said, not who speaks. "Efficiency is intelligent laziness." -David Dunham "Think for yourself!" - Abigail "Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon	[reply]

Replies are listed 'Best First'.

Re^3: recursive formula.
by BrowserUk (Patriarch) on Aug 07, 2004 at 05:34 UTC

Thanks. That's the source of my misunderstanding. I saw the r₀ = 0 reference, but I also saw r running 1 .. n and i running 1 to n.

I missed that n-i = 0 whenever n=i. Stupid.

Examine what is said, not who speaks.

"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
"Memory, processor, disk in that order on the hardware side. Algorithm, algorithm, algorithm on the code side." - tachyon

[reply]