Log in Sign up
Back to Discover
🔢

Geometric distribution

math Maturity 7-9

You can try things until you win.

geometric pmf.svg
geometric pmf.svg
You might roll a die many times. You wait for a one to show up. Each roll is a new try. It does not matter if you lost before. Can you guess how many tries you need?
geometric cdf.svg
geometric cdf.svg

48 words

Imagine you roll a die. You want to get a one. You might roll it many times.

geometric pmf.svg
geometric pmf.svg
Each roll is a new try. It does not matter if you lost before. The next roll is still a new start. This is called being memoryless.
geometric cdf.svg
geometric cdf.svg
You can count how many tries it takes to win. You can also count how many times you fail first. Both ways help us understand the pattern. It is a way to study how we wait for a win.

87 words

Imagine you are rolling a die. You want to roll a one. You might get it on your first try. You might fail many times before you win. This pattern is called a geometric distribution.

geometric pmf.svg
geometric pmf.svg

There are two ways to look at this. One way counts the total number of tries. The other way counts only the failures before the first win. Scientists use these ideas to study how long we wait for something to happen.

One special part of this math is being memoryless. This means your past does not change your future. If you fail ten times, the next roll is still a fresh start. The chance of winning stays the same every time.

geometric cdf.svg
geometric cdf.svg

This math also helps us find averages. If you roll a six-sided die, the average number of tries to get a one is six. If you only count failures, the average is five. This pattern is also linked to something called the exponential distribution. That is used for things that happen in a smooth flow rather than in steps.

179 words

Have you ever wondered how long you might have to wait for something to happen? Imagine you are rolling a six-sided die over and over. You want to see a "1" land face up. You might get it on your very first try. Other times, you might fail many times before you finally win. This pattern of waiting for a success is called a geometric distribution.

geometric pmf.svg
geometric pmf.svg
This math helps us predict how many tries we might need. It is a way to measure the chance of a single event happening after several failed attempts.

There are two different ways to count these attempts. The first way counts every single try, including the one where you finally succeed. This is sometimes called the shifted geometric distribution. The second way only counts the failures that happen before you win. For example, if you succeed on your third try, you had two failures. Both ways are useful, but they use different math rules. It is important to know which one you are using to avoid confusion.

geometric cdf.svg
geometric cdf.svg

This idea has a very special quality called memorylessness. This means the past does not affect the future. If you have already failed ten times, the chance of winning on the next roll stays exactly the same. The die does not "remember" that you have been losing. This is a unique trait for this kind of math. In fact, the geometric distribution is the only one of its kind that works this way for discrete steps. This makes it very different from many other patterns.

We can use math to find the average or "expected" results. If you are rolling a die to get a "1," the chance of success is one in six. On average, you will need six total tries to see that "1." If you only count the failures, the average is five. These numbers help scientists plan for things that happen by chance. The name "geometric" comes from the fact that the probabilities follow a geometric sequence. Some people also call it the Furry distribution after Wendell H. Furry.

This math connects to many other big ideas in science. If you add many of these distributions together, you get something called a negative binomial distribution. The geometric distribution is also a special version of that. It also links to the exponential distribution, which is used for things that happen in a smooth flow. Scientists use these tools to study uncertainty and information. By understanding these patterns, we can better understand how random events work in our world.

428 words

The geometric distribution is a fundamental concept in probability theory and statistics. It describes the likelihood of when a specific success will occur during a series of repeated trials. These trials must be independent, meaning one result does not change the chance of the next. Each trial must also be a Bernoulli trial, which is a fancy way of saying there are only two possible outcomes: success or failure. This distribution is essential for modeling waiting times in random processes. It helps mathematicians understand how much uncertainty exists when we wait for an event to happen.

geometric pmf.svg
geometric pmf.svg

To use this math, we must first define what we are actually counting. There are two distinct versions of the geometric distribution. The first version counts the total number of trials required to reach the first success. This is often called the shifted geometric distribution. The second version counts only the number of failures that occur before that first success happens. For example, if you succeed on your fourth attempt, the first version would give you the number 4. The second version would give you the number 3. Because these two methods result in different numbers, mathematicians must be very clear about which one they are using.

geometric cdf.svg
geometric cdf.svg

The math relies on a single parameter called $p$, which is the probability of success on any single trial. If you are rolling a six-sided die and want to roll a "1," your $p$ is $1/6$. The probability of the first success occurring on a specific trial follows a geometric sequence. This means the probability of success decreases at a steady rate as you wait longer. The probability mass function, or the formula used to find these probabilities, changes depending on whether you are counting total trials or just failures. If you count total trials, the first possible success is at trial 1. If you count failures, the first possible result is 0.

One of the most famous properties of the geometric distribution is memorylessness. This is a unique characteristic that no other discrete probability distribution possesses. Memorylessness means that the number of previous failures has absolutely no effect on how many more trials you will need. If you have already failed ten times, the probability of succeeding on the next try is exactly the same as it was on the very first try. The process does not "remember" that it has been failing. This makes it the discrete version of the exponential distribution, which is used for continuous time.

We can use the distribution to calculate several important statistics, such as the expected value and variance. The expected value is the long-term average result you would see if you repeated the experiment many times. If you are rolling a die to get a "1," the expected number of trials is $1/p$, which is 6. The expected number of failures is $(1-p)/p$, which is 5. The variance, which measures how much the results spread out, is $(1-p)/p^2$ for the number of trials. These specific values allow scientists to predict the typical scale of waiting periods in various systems.

geometric pmf.svg
geometric pmf.svg

Beyond simple counting, the geometric distribution connects to complex mathematical ideas like entropy and Fisher information. Entropy is a way to measure the amount of uncertainty in a system. For this distribution, entropy increases as the probability of success $p$ decreases. This makes sense because if an event is very rare, there is more uncertainty about when it will happen. Fisher information measures how much information an observation gives us about the unknown parameter $p$. As success becomes rarer, the Fisher information increases, meaning each result tells us more about the underlying probability.

Finally, the geometric distribution is a building block for many other mathematical models. If you add together several independent geometric random variables, you create a negative binomial distribution. It is also a special, simpler case of the negative binomial distribution where the number of successes required is exactly one. In the world of computer science, Golomb coding uses this distribution to create optimal prefix codes. By understanding these connections, researchers can bridge the gap between simple coin flips and complex data compression or biological modeling.

695 words
🖼️ Images & Media (2)
File:geometric pmf.svg
geometric pmf.svg
File:geometric cdf.svg
geometric cdf.svg
Up Next
🔢
Bernoulli distribution
Math
More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.