Premium problem104. Exactly k Requests

Easy Locked

Requests arrive as a Poisson process at rate per unit time. Return the probability of exactly k arrivals during a window of length t.

P(N=k)=(λt)ke−λtk!P(N = k) = \frac{(\lambda t)^k e^{-\lambda t}}{k!}

Input

rate = 3.0
t = 2.0
k = 5

Output

0.16062314104798003

Premium problem

This one's part of Premium. Unlock the full Probability track plus every other premium problem on the site.

Implement solve(...)