For a Poisson count averaging 3 support tickets per hour, what is the probability of zero tickets in an hour?
answer
- the exponential term does the work
- k = 0 kills the lambda power
- e to the minus lambda
- lambda must match the window length
basics
~20 sThe Poisson mass function is P(X = k) = e^(-λ) λ^k / k!. With λ = 3 tickets per hour, P(X = 0) = e^(-3), about 0.0498, so roughly a 5 percent chance of a completely quiet hour.
solid answer
~40 sA Poisson count with rate λ over a fixed window has `P(X = k) = e^(-λ) · λ^k / k!`. Here λ = 3 per hour, so P(X = 0) = e^(-3) ≈ 0.0498 — about one hour in twenty sees no ticket at all, and P(at least one) ≈ 0.95. The key mechanic beyond the formula is that λ scales with the length of the window: over 30 minutes λ becomes 1.5 and P(0) = e^(-1.5) ≈ 0.223; over 20 minutes λ = 1 and P(at least one) = 1 - e^(-1) ≈ 0.632. This is only valid if tickets arrive independently at a stable average rate with no bursts, which is exactly the assumption an interviewer will probe next.
go deeper
Be ready to write the Poisson mass function from memory and evaluate it for small k, especially k = 0 where the answer is just e to the minus lambda. Know that lambda is an expected count over a stated window.
Explain how lambda rescales when the window changes and why independent Poisson counts add. Be able to compute a tail probability like P(at least one) from its complement instead of summing terms.
Demonstrate that you check the constant-rate and independence assumptions against real traffic. Explain why bursty or time-of-day-varying arrivals make single-lambda tail probabilities dangerously optimistic for capacity decisions.
Own the choice of what to model: whether one pooled rate, per-time-block rates or a rate that varies serves the decision better, and be explicit about the cost of underestimating peaks versus the cost of over-provisioning.
## The distribution A Poisson random variable counts how many events occur in a fixed window — an hour, a day, a page of text — when events happen independently at a stable average rate. It has a single parameter λ (lambda), the **expected number of events in that window**, and its probability mass function is `P(X = k) = e^(-λ) · λ^k / k!` for k = 0, 1, 2, ... Here `k!` is the factorial (0! = 1) and e ≈ 2.71828. The support is all non-negative integers with no upper bound, which distinguishes it from a binomial count capped at n. ## Answering the question With λ = 3 tickets per hour and k = 0: `P(X = 0) = e^(-3) · 3^0 / 0! = e^(-3) · 1 / 1 = e^(-3) ≈ 0.0498`. So about a 5 percent chance of a silent hour, and P(at least one ticket) = 1 - e^(-3) ≈ 0.9502. The whole low end of the distribution is worth having at your fingertips: - P(0) ≈ 0.0498 - P(1) = 3e^(-3) ≈ 0.1494 - P(2) = e^(-3)·9/2 ≈ 0.2240 - P(3) = e^(-3)·27/6 ≈ 0.2240 - P(X ≤ 2) ≈ 0.4232 Notice P(2) = P(3): whenever λ is a whole number the distribution is flat-topped, with modes at λ - 1 and λ. ## λ scales with the window The single most-tested mechanic here is that λ is tied to an interval, and it scales **linearly** with that interval's length when the rate is constant. At 3 per hour: - 30 minutes → λ = 1.5, P(0) = e^(-1.5) ≈ 0.223 - 20 minutes → λ = 1, P(at least one) = 1 - e^(-1) ≈ 0.632 - 8 hours → λ = 24, P(0) = e^(-24), effectively zero A candidate who plugs λ = 3 into a half-hour question has made the classic error. Always restate the rate in the units of the window you are asked about. ## Additivity If two independent Poisson counts have rates λ₁ and λ₂, their sum is Poisson with rate λ₁ + λ₂. Email tickets at 3 per hour plus chat tickets at 5 per hour, if independent, give a combined Poisson(8) count. This makes Poisson models convenient to aggregate across channels, regions or time blocks — but only under independence. ## The assumptions The Poisson model is the right description when, in the window of interest: 1. events occur **independently** — one ticket neither invites nor suppresses the next; 2. the average rate is **constant** across the window; 3. events do not occur **simultaneously** — in a short enough slice the chance of two is negligible. Real support traffic often breaks all three. An outage produces a burst of correlated tickets. Rates vary sharply by hour of day and by weekday. A batch integration can file several tickets at the same instant. Each violation produces counts that are more dispersed than the model expects, so Poisson tail probabilities computed from a single λ will be too optimistic: a "1-in-500 hour" under the model may occur weekly in reality. ## Practical framing When you use this for capacity planning, the useful outputs are not point probabilities but tail questions: P(X > c) for a staffing threshold c. With λ = 3, P(X ≥ 8) is well under 1 percent, so a desk sized for eight concurrent tickets is comfortable in a *typical* hour. The judgment call is that a single λ fitted to an all-day average will badly understate the peak hour; fitting separate rates by time block, or planning against the busiest block's λ, is the honest approach. ## Common errors Treating λ as a probability (it is a count, and can exceed 1), forgetting to rescale λ to the asked-about window, saying P(0) must be zero because "some tickets always arrive", or writing P(0) as λe^(-λ), which is actually P(1). Also remember λ need not be an integer — 1.5 tickets per half hour is a perfectly valid rate even though you cannot observe 1.5 tickets.
- At the same rate, what is the probability of at least one ticket in a 20-minute window?Rescale the rate first: 3 per hour over a third of an hour gives λ = 1. Then P(at least one) = 1 - P(0) = 1 - e^(-1) ≈ 0.632. The common mistake is leaving λ at 3 and reporting 0.95.
- Two independent ticket streams average 3 and 5 per hour — what is the distribution of the combined count?Poisson with rate 8 per hour. Independent Poisson counts add: their rates sum and the total is again Poisson. So P(no tickets from either stream in an hour) = e^(-8), roughly 0.0003. Independence is essential; a shared outage driving both streams breaks it.
- What assumptions must hold for hourly ticket counts to be Poisson?Tickets must arrive independently, at a stable average rate across the window, with no simultaneous arrivals. Real desks violate all three: outages cause correlated bursts, rates swing by hour of day, and batch jobs file several at once. Each violation inflates the true spread beyond what the model predicts.
saying these in an interview costs you the question
- Uses lambda without rescaling to the asked window
- Treats lambda as a probability rather than a count
- Says P(zero events) must be zero
- Writes P(0) as lambda times e to the minus lambda
- Claims lambda must be a whole number