Starlight Tools

Binomial & Poisson Distribution Calculator

Calculate exact, cumulative, tail, and range probabilities for binomial and Poisson distributions. Includes formulas, mean, variance, standard deviation, PMF/CDF table, and chart.

Inputs

Distribution

Probability type

Use k for exact and one-sided tail probabilities.

Binomial parameters

n ≥ 0 integer, 0 ≤ p ≤ 1. k can be outside [0,n]; out-of-range probabilities are handled exactly.

Tip: Ctrl/Cmd + K focuses the first input. Ctrl/Cmd + Enter recalculates.

Results

Results will appear here.
Probability Mass Function (PMF)
Bars show P(X = x). Highlighted bars match the selected probability.

Step-by-step calculation

  1. Example calculation steps will appear here.

PMF & CDF table

kPMF P(X=k)CDF P(X≤k)

Understanding the Binomial and Poisson Distributions

Release Updates

v1.1 (June 7, 2026)

  • Added exact, less-than, at-most, more-than, at-least, between, and outside-range probability modes.
  • Added range inputs for a and b, with chart highlighting for the selected probability region.
  • Added standard deviation, mode, percentage output, and a plain-English probability answer.
  • Added step-by-step calculation output with formula selection, value substitution, and final result.
  • Added preloaded Binomial and Poisson examples so results, chart, and the PMF/CDF table appear immediately.

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) \); the standard deviation is √(np(1−p)). The expected count need not be an integer. Typical uses include pass/fail testing, survey responses, and quality control with independent trials and a constant success probability. Formula reference: NIST/SEMATECH e-Handbook, Binomial Distribution (https://www.itl.nist.gov/div898/handbook/eda/section3/eda366i.htm). Hypothetical example: four independent trials, each with success probability 0.5, call for a binomial model with n=4 and p=0.5. The probability of exactly two successes is P(X=2)=C(4,2)×0.5²×0.5²=6×0.0625=0.375. Thus, exactly two successes occur with probability 37.5% under this model.

The Poisson distribution models event counts in a fixed interval of time, distance, or area under suitable independence and constant-rate assumptions. Here λ (lambda) is the expected event count for the chosen interval. If \( X \sim \mathrm{Pois}(\lambda) \), then \( P(X=k)=e^{-\lambda}\lambda^k/k! \) for nonnegative integer k, with \( \mathbb{E}[X]=\lambda \), \( \mathrm{Var}(X)=\lambda \), and standard deviation √λ. The expected count need not be an integer. When λ=0, X=0 with probability 1. Formula reference: NIST/SEMATECH e-Handbook, Poisson Distribution (https://www.itl.nist.gov/div898/handbook/eda/section3/eda366j.htm). Hypothetical example: suppose arrivals follow a Poisson model with an expected count of λ=2 during the chosen interval. The probability of no arrivals is P(X=0)=e^(−2)×2⁰/0!=e^(−2)≈0.1353, or about 13.53%.

When to Choose Binomial vs Poisson

  • Use Binomial when the number of opportunities is fixed (n known), each trial is independent, and the success probability is constant (p).
  • Use Poisson when a Poisson model is suitable for event counts over a fixed interval, with independent occurrences and a stable event rate. Enter λ as the expected count for that interval. This is direct Poisson modeling; it does not require an underlying fixed number of binomial trials.
  • Connection: When n is large and p is small with \( \lambda=np \) moderate, Poisson can approximate Binomial. This approximation is distinct from directly modeling event counts with Poisson; its accuracy depends on the parameters and the probability being requested.

Reading the Graph and Tail Probabilities

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”. Define F(k)=P(X≤k). For integer thresholds, P(X<k)=F(k−1), P(X≥k)=1−F(k−1), and P(X>k)=1−F(k). For integer endpoints a≤b, an inclusive range has probability P(a≤X≤b)=F(b)−F(a−1). Its complement excludes both endpoints: P(X<a or X>b)=F(a−1)+1−F(b). These identities describe the mathematical endpoint conventions; they do not establish which endpoints the calculator's range modes include.

Approximations & Practical Tips

  • Normal approximation (Binomial): A common screening rule is np≥5 and n(1−p)≥5, but approximation accuracy depends on the parameters and the requested tail. For Y with normal mean np and variance np(1−p), continuity correction gives P(X≤k)≈P(Y≤k+0.5) for at-most questions and P(X≥k)≈P(Y≥k−0.5) for at-least questions. A screening rule does not guarantee accurate extreme-tail probabilities. Reference: Penn State STAT 414, Approximations for Discrete Distributions (https://online.stat.psu.edu/stat414/Lesson28). This is mathematical guidance, not a description of the calculator's numerical implementation.
  • Normal approximation (Poisson): For large \( \lambda \), \(X\) may be approximated by \( \mathcal{N}(\lambda,\;\lambda) \), where the second parameter is the variance. Accuracy depends on λ and the requested tail. For this normal variable Y, use P(Y≤k+0.5) to approximate P(X≤k), and P(Y≥k−0.5) to approximate P(X≥k). These are approximation conventions, not claims about the calculator's implementation.
  • Rate vs probability: In Poisson problems, λ is an expected count, not a probability or a rate per unit time. If r is the event rate per unit time and t is the interval duration, λ=r×t. Match the units: hypothetically, 6 arrivals per hour over 30 minutes gives t=0.5 hours and λ=6×0.5=3 expected arrivals. Apply the same unit matching to rates per unit distance or area.

Common Pitfalls

  • Non-independence: If trials or events influence each other, both models can mislead.
  • Changing probabilities/rates: If p changes across trials, or the event rate changes over time, reassess the model assumptions. A different interval length can change λ even when the event rate is constant. Choosing another model requires understanding how probabilities, rates, or dependence vary.
  • Parameter bounds: Binomial requires a nonnegative integer n and 0≤p≤1; Poisson requires λ≥0. Binomial counts lie among the integers 0 through n, and Poisson counts are nonnegative integers; boundary parameter values may concentrate all probability on one count. These possible counts are distinct from query thresholds: integer thresholds outside those ranges still define valid probability questions. For example, P(X=−1)=0 and P(X≥−1)=1 for either model, while P(X≤n+1)=1 for Binomial. This distinction does not change the existing input handling.

Interpret each probability under the chosen model and its assumptions. This calculator computes probabilities from supplied parameters; it does not estimate success probabilities or event rates from observed data. Check whether independence, a constant success probability, or a stable event rate is reasonable before using the results to inform decisions.

5 Fun Facts about Binomial & Poisson

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.

One-shot case

Poisson events “add up”

Independent Poisson streams with rates \(\lambda_1\) and \(\lambda_2\) merge into another Poisson with rate \(\lambda_1+\lambda_2\).

Rates add

Rare binomial ≈ Poisson

When n is large and p is tiny but \(np=\lambda\) is moderate, binomial probabilities track Poisson surprisingly well.

Rare-event hack

Mode hugs the mean

For Poisson, a positive noninteger λ has the single mode floor(λ); a positive integer λ has two modes, λ−1 and λ. When λ=0, only 0 is a mode. For Binomial with n>0 and 0<p<1, let m=(n+1)p: if m is not an integer, the mode is floor(m); if m is an integer, m−1 and m are both modes. At p=0 the sole mode is 0; at p=1 it is n. If n=0, the sole mode is 0 for every allowed p. References: NIST/SEMATECH e-Handbook, Binomial Distribution (https://www.itl.nist.gov/div898/handbook/eda/section3/eda366i.htm) and Poisson Distribution (https://www.itl.nist.gov/div898/handbook/eda/section3/eda366j.htm).

Peak finder

Waiting times are exponential

In a homogeneous Poisson process with a positive constant rate r, successive gaps between events are independent exponential waiting times with mean 1/r. These waiting times are memoryless—conditional on no arrival so far, the remaining wait has the same distribution as a fresh wait. Reference: ProbabilityCourse, Basic Concepts of the Poisson Process (https://www.probabilitycourse.com/chapter11/11_1_2_basic_concepts_of_the_poisson_process.php).

Arrival lore

Explore more tools