Geometric Distribution Calculator

About Geometric Distribution Calculator

The Geometric Distribution Calculator computes exact probabilities for the number of independent Bernoulli trials needed to achieve the first success. Enter the probability of success per trial and the trial number (or number of failures) to instantly get point and cumulative probabilities, step-by-step solutions, animated trial sequence visualizations, PMF/CDF charts, and a complete distribution table. Both parameterizations — trial number and failures before success — are fully supported.

What Is the Geometric Distribution?

The geometric distribution is a discrete probability distribution that models the number of independent trials needed to get the first success in a sequence of Bernoulli trials. Each trial has the same probability p of success and probability q = 1 − p of failure. It is the discrete analogue of the exponential distribution and is the only discrete distribution with the memoryless property.

Two Common Parameterizations

The geometric distribution has two standard forms, which often causes confusion. This calculator supports both:

• Trials parameterization (X): X counts the trial number on which the first success occurs. X takes values 1, 2, 3, … and P(X = k) = (1 − p)^k−1 × p. The mean is 1/p.
• Failures parameterization (Y): Y counts the number of failures before the first success. Y takes values 0, 1, 2, … and P(Y = k) = (1 − p)^k × p. The mean is (1 − p)/p. Note that Y = X − 1.

The Geometric PMF Formula

For the trials parameterization (the default in this calculator):

P(X = k) = (1 − p)^k−1 × p, for k = 1, 2, 3, …

The intuition is simple: the first (k − 1) trials must all be failures (each with probability 1 − p), and the k-th trial must be a success (probability p). Since the trials are independent, we multiply these probabilities together.

CDF (Cumulative Distribution Function)

The CDF has a clean closed-form expression:

P(X ≤ k) = 1 − (1 − p)^k

This gives the probability that the first success occurs within the first k trials. It is equivalent to 1 minus the probability that all k trials are failures.

Mean, Variance, and Other Statistics

• Mean (Expected Value): E[X] = 1/p — On average, you need 1/p trials to get the first success.
• Variance: Var(X) = (1 − p) / p² — Higher variance when p is small (success is rare).
• Standard Deviation: σ = √((1 − p) / p²)
• Median: ⌈−1 / log₂(1 − p)⌉ — The smallest k such that P(X ≤ k) ≥ 0.5.
• Mode: Always 1 — The most likely outcome is success on the first trial.
• Skewness: (2 − p) / √(1 − p) — Always positive (right-skewed).

The Memoryless Property

The geometric distribution is the only discrete distribution with the memoryless property:

P(X > s + t | X > s) = P(X > t)

This means that if you have already failed s times, the probability of needing at least t more trials is the same as if you were starting fresh. Past failures do not change future probabilities — which makes sense because each trial is independent.

Common Applications

• Coin Flipping — How many flips until the first heads? With p = 0.5, the expected number is 2 flips.
• Sales and Marketing — How many cold calls until the first sale? If the conversion rate is 5%, expect about 20 calls on average.
• Quality Control — How many items must be inspected before finding the first defect? Models the waiting time for rare events.
• Gambling and Games — How many rolls of a die until rolling a 6? With p = 1/6, the expected number is 6 rolls.
• Network Reliability — How many packet transmissions until one succeeds? Models retransmission protocols in computer networks.
• Genetics — How many offspring until one with a specific trait appears? Applies when trait inheritance follows Mendelian ratios.

Relationship to Other Distributions

• Negative Binomial: The geometric distribution is a special case of the negative binomial with r = 1 (waiting for exactly 1 success).
• Exponential: The geometric distribution is the discrete analogue of the continuous exponential distribution. Both have the memoryless property.
• Bernoulli: Each trial follows a Bernoulli distribution. The geometric distribution counts how many Bernoulli trials until the first success.

How to Use This Calculator

1. Enter the probability of success (p) per trial. This must be between 0 (exclusive) and 1 (inclusive).
2. Choose the parameterization: trial number (k = 1, 2, 3, …) or failures before success (k = 0, 1, 2, …).
3. Enter the value of k.
4. Click "Calculate Probability" to see exact and cumulative probabilities, step-by-step solutions, an animated trial sequence, PMF/CDF charts, and the full distribution table.
5. Use the quick scenario buttons to explore common real-world examples instantly.

Frequently Asked Questions

What is the geometric distribution used for?

The geometric distribution models the number of independent trials needed to get the first success. It is used whenever you want to answer the question "How many times do I have to try before I succeed?" assuming each attempt has the same probability of success. Common applications include sales call analysis, quality inspection, gambling, network retransmission, and genetics.

What is the difference between the two parameterizations?

The trials parameterization counts the trial number of the first success (starting from 1), while the failures parameterization counts the number of failures before the first success (starting from 0). They differ by exactly 1: if X is the trial number, then Y = X − 1 is the failure count. Both give the same probability value for the corresponding k.

What is the memoryless property?

The memoryless property means that past failures do not affect the probability of future success. If you have already flipped a fair coin 10 times without getting heads, the probability of needing exactly 1 more flip is still 0.5 — the coin does not "remember" past flips. The geometric distribution is the only discrete distribution with this property.

How is the geometric distribution related to the negative binomial?

The geometric distribution is a special case of the negative binomial distribution where you wait for exactly r = 1 success. The negative binomial generalizes this to waiting for r successes, where r can be any positive integer.

Why is the mode always 1?

The mode is always 1 (or 0 in the failures parameterization) because the most likely single outcome is success on the very first trial — this has probability p, which is the highest possible value of the PMF. Each subsequent trial has a strictly lower probability because it requires an additional failure first.