Binomial collapses to Bernoulli
Set n=1 and the binomial becomes a single yes/no trial (a Bernoulli). Every coin flip is a tiny binomial.
n ≥ 0 integer, 0 ≤ p ≤ 1, k ≥ 0 integer (we clamp k to [0,n]).
Tip: Ctrl/Cmd + K focuses the first input. Ctrl/Cmd + Enter recalculates.
| k | PMF P(X=k) | CDF P(X≤k) |
|---|
The binomial distribution models the number of “successes” in a fixed number of independent trials. You specify n (number of trials) and p (success probability for each trial). If \( X \sim \mathrm{Bin}(n,p) \), then the probability of exactly k successes is \( P(X=k)=\binom{n}{k}p^k(1-p)^{\,n-k} \). The expected value and variance are \( \mathbb{E}[X]=np \) and \( \mathrm{Var}(X)=np(1-p) \). Typical uses include pass/fail testing, survey responses, and quality control where the number of attempts is known in advance and each attempt has the same chance of success.
The Poisson distribution models the number of events occurring in a fixed interval of time, distance, or area when events happen independently at a constant average rate \( \lambda \) (lambda). If \( X \sim \mathrm{Pois}(\lambda) \), then \( P(X=k)=e^{-\lambda}\lambda^k/k! \), with \( \mathbb{E}[X]=\lambda \) and \( \mathrm{Var}(X)=\lambda \). It is widely used for arrivals (calls per minute, patients per hour, defects per metre), and other “count per interval” scenarios across the US, UK, EU, India, and beyond.
The bar chart shows the probability mass function (PMF) \(P(X=k)\) for each integer \(k\). Our summary also reports the cumulative distribution function (CDF) \(P(X\le k)\) and the right tail \(P(X\ge k)\). Left tails are useful for questions like “no more than k”, while right tails answer “at least k”. In education settings (GCSE/A-Level, AP/College) and in industry (manufacturing QA/QC, call centres, hospitals), tail probabilities help with decision thresholds, alarms, and service-level guarantees.
Note: This calculator supports coursework and professional work across the US, UK (modelling/modelling), EU, India, Australia, and more—use it to estimate defect rates, queue arrivals, pass rates, and service targets with clear PMF/CDF visuals.
Set n=1 and the binomial becomes a single yes/no trial (a Bernoulli). Every coin flip is a tiny binomial.
Independent Poisson streams with rates \(\lambda_1\) and \(\lambda_2\) merge into another Poisson with rate \(\lambda_1+\lambda_2\).
When n is large and p is tiny but \(np=\lambda\) is moderate, binomial probabilities track Poisson surprisingly well.
A Poisson’s most likely count sits at \(\lfloor\lambda\rfloor\) or \(\lceil\lambda\rceil-1\); for binomial, it’s near \((n+1)p\).
In a Poisson process, the gap between events is exponential and memoryless—the next arrival doesn’t care how long you’ve already waited.