AI generatedProbability

Exactly and at least probabilities

  • At each split, the outgoing probabilities sum to 1.
  • Multiply along a route; add mutually exclusive routes that meet the question.
  • Without replacement, update the counts and total for the second draw.

Example 1

A bag contains 3 red and 3 blue counters. Two counters are drawn with replacement, mixing between draws. Find the probability of exactly one red.

Two-stage probability treeFirstSecondRRBBRB
Red then blue is one route.Blue then red is a different route.Add these mutually exclusive routes.

Example 2

A bag contains 3 red and 3 blue counters. Two counters are drawn with replacement, mixing between draws. Find the probability of at least one red.

Two-stage probability treeFirstSecondRRBBRB
The only way to have no red is blue twice.Subtract the complement from 1.

Example 3

There are 4 independent trials, each with success probability . Find .

Multiply the failure probabilities.The complement of at least one is none.

Example 4

Three independent trials each have success probability . Find .

The three disjoint routes with exactly two successes
RouteProbability
SSF
SFS
FSS
Multiply along one three-stage route.Add the three equally probable disjoint routes.

Your turn

Question 1

A bag contains 4 red and 3 blue counters. Two counters are drawn with replacement, mixing between draws. Find the probability of exactly one red.

Two-stage probability treeFirstSecondRRBBRB
Check answer
Question 2

A bag contains 5 red and 3 blue counters. Two counters are drawn with replacement, mixing between draws. Find the probability of exactly one red.

Two-stage probability treeFirstSecondRRBBRB
Check answer
Question 3

A bag contains 6 red and 3 blue counters. Two counters are drawn with replacement, mixing between draws. Find the probability of at least one red.

Two-stage probability treeFirstSecondRRBBRB
Check answer
Question 4

There are 5 independent trials, each with success probability . Find .

Check answer
Question 5

Three independent trials each have success probability . Find .

The three disjoint routes with exactly two successes
RouteProbability
SSF
SFS
FSS
Check answer