Let's say that I know the probability of a "success" is P. I run the test N times, and I see S successes. The test is akin to tossing an unevenly weighted coin (perhaps heads is a success, tails is a failure). I want to know the approximate probability of seeing either S successes, or a number of successes less likely than S successes...
I'm interested in learning more of the math behind computer science, partly so I can dip into Knuth's TAOCP without my head spinning too much. I've tried going through Concrete Mathematics but it's a little too much for me unfortunately. Are there books out there below this one but well above Math for Dummies? I own discrete math book...
I am trying to build a mathematical model of the availability of a file in a distributed file-system. I posted this question at MathOverflow but this might as well be classified as a CS-question so I give it a shot here as well. The system works like this: a node stores a file (encoed using erasure codes) at r*b remotes nodes, where r ...
This post is really helpful: http://stackoverflow.com/questions/1095650/how-can-i-efficiently-calculate-the-binomial-cumulative-distribution-function (Title = How can I efficiently calculate the binomial cumulative distribution function?) However, I need the negative binomial cumulative distribution function. Is there a way to tweek ...