Consider the following typical probability scenario:
I defined this function to handle that scenario, I'm curious if Python has a more efficient method to handle this, or if this is the best way:
from scipy.special import binom def grade_of_service(n, p, c): prob = 0 k = c + 1 while k <= n: prob += binom(n, k)*(p**k)*((1-p)**(n-k)) k += 1 return prob
EDIT: Here's an example solution from the author of this example: "If n = 100, p=0.1, and c=15, the probability of interest turns out to be 0.0399." My probability does round to this result. But due to the roundoff error / numerical precision, it doesn't seem to matter if k = n or k = n+1.