Beefy Boxes and Bandwidth Generously Provided by pair Networks vroom
The stupid question is the question not asked
 
PerlMonks  

Re^3: recursive formula.

by trammell (Priest)
on Aug 05, 2004 at 10:57 UTC ( [id://380278]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re^2: recursive formula.
in thread recursive formula.

So is it the case that: 
  P(r1) = (r1 - r0) P()
        = r1

[download]
Correct?

Replies are listed 'Best First'.
Re^4: recursive formula.
by BioGeek (Hermit) on Aug 05, 2004 at 11:02 UTC
    Yes, that's correct

    Or, like rsteinke explained it much better than I can in the chatterbox:
    "If P(r_1) is the probability of getting r_1, and P(r_1,r_2) is the probability of getting r_1 and r_2, then P() is the probability of anything at all happening (unconstrained), which is 1"
[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://380278]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.