CDF of

GeometricDistribution is an example of a right continuous function:

A coin-tossing experiment consists of tossing a fair coin repeatedly until a tail results. Simulate the process:

Compute the probability that at least 4 coin tosses will be necessary:

Compute the expected number of coin tosses:

A person is standing by a road counting cars until he sees a red one, at which point he restarts the count. Simulate the counting process, assuming that 20% of the cars are red:

Find the expected number of cars to come by before the count starts over:

Find the probability of counting 10 or more cars before a red one:

A student will take a test repeatedly until he or she passes it, each time succeeding with probability

p. Find the probability that the student succeeds in

attempts or less:

Given that the student passes the test in

attempts or less, find the PDF:

A budget-priced lighter has 0.90 probability of lighting on any given attempt. Simulate the lighting process; the result indicates the number of failures before successful lighting:

Find the probability that the lighter lights in 3 trials or less:

A cereal box contains one out of a set of

different plastic animals. The animals are equally likely to occur, independently of what animals are in other boxes. Simulate the animal collection process, assuming there are 10 animals for 25 boxes:

After

unique animals have been collected, the number of boxes needed to find a new unique animal among the remaining

follows a geometric distribution with parameter

. Find the expected number of boxes needed to get a new unique animal:

Number of boxes before next unique animal:

Find the expected number of boxes needed to collect 6 unique animals:

When a computer accesses memory, the desired data is in the cache with probability

p. A cache miss occurs if the desired data is not in the cache. Find the probability of a cache miss on the

memory access:

Find the probability that the first cache miss occurs after the 4

memory access:

Find the average number of memory accesses before the first cache miss:

Simulate the number of cache hits before a cache miss occurs, assuming 20% of your data is in the cache:

Assuming that access time is 10 ns for cache and 1000 ns for RAM, find the average access time:

A data stream containing

data packets is repeatedly sent without order information. Find the distribution of the number of tries until the data stream arrives with all the packets in the right order for the first time:

Find the probability that the packets will arrive in the correct order on the 20

try or sooner:

Simulate the number of tries until the first ordered data stream:

Find the average number of tries until the first ordered data stream:

A player bets amount

in a casino with no betting limit in a game with chance of winning

. If he loses he doubles the bet, and if he wins he quits, hence the number of games played follows a geometric distribution, with expected number of games played represented as follows:

The cash reserve needed to win the

game:

The player always leaves the casino collecting the amount of the initial bet:

The cash reserve needed to execute the above strategy is finite only for strictly favorable games, where

:

In an optical communication system, transmitted light generates current at the receiver. The number of electrons follows the parametric mixture of Poisson distribution and other distributions, depending on the type of light. If the source uses coherent laser light of intensity

, then the electron count distribution is Poisson:

If the source uses thermal illumination, then the Poisson parameter follows

ExponentialDistribution with parameter

, and the electron count distribution is:

These two distributions are distinguishable and allow you to determine the type of source:

Find the sampling population expectation of the method of moment estimator for p:

Find sampling population expectations for a few small sample sizes:

Prove that these are positively biased:

Plot the bias: