Any two distinct draw positions have the same pair law by exchangeability. The marginal and pair probabilities in sampling without replacement therefore give
Divide this joint probability by the relevant marginal probability to get the two conditional probabilities:
Conditioning on the third draw can change the probability of the second draw; conditional probability does not require the conditioning event to occur earlier in time.
The first black draw has probability . Given that event, three of the remaining six balls are black. The multiplication rule therefore gives
Using would incorrectly treat the draws as independent.
Uniform sampling without replacement is equivalent to revealing a uniformly random permutation of seven labelled balls. Each draw position is equally likely to contain any label, so its colour has the original proportions. Thus
For example the law of total probability gives . Equal marginal probabilities express exchangeability, rather than independence between successive draws.
A uniform distribution has constant density on its support, fixed by normalization. Thus
The density's assigned values at the endpoints do not affect probabilities.
Normalization requires . Therefore
The graph rises linearly from zero to the left-hand limit , then drops to zero beyond . Its enclosed triangular area is one. The combined sketch in (f) uses dimensionless time and shows this density together with the cumulative probabilities.
The graph of the positive-delay probability density function is a horizontal segment at height from to , followed by zero from to . Values at individual endpoints do not affect probabilities. The separate atom at zero is not a finite-height part of this density graph.
Figure 1.
Positive-delay density and the full cumulative distribution, whose jump records the no-delay atom
. Details.
The companion cumulative distribution function in the figure is for , for , and for . Its jump at zero displays the discrete part without confusing density height with probability mass.
For a stop-phase arrival at time , the delay is . An interval of delays of width therefore corresponds to an interval of arrival phases of the same width, because . Its unconditional probability is . Hence the positive-delay part has density
This ordinary density integrates to , not to one: the remaining probability mass is at . Thus has a uniform distribution with an atom at zero, with mixing weight . Conditional on a positive delay, the density would instead be on .
The arrival phase has a uniform distribution over a cycle of length . The no-delay phases occupy length , so
Individual phase endpoints have probability zero. The model neglects clearance time and releases waiting vehicles together when the stop interval ends; the degenerate case is interpreted as release at successive cycle boundaries.
The probability of a positive delay is the integral of its density:
Adding the separate no-delay event gives
This is the normalization of a probability distribution with both discrete and continuous parts.
The remaining arrivals occur in the next stop phase: , or . B waits until , while A departed at , giving . This interval has length , hence
Endpoint assignments do not affect probabilities. The three outcomes are exhaustive and satisfy
These are conditional probabilities for the stated fixed ; there is no additional averaging over A's arrival phase in the question.
Three draws cannot all be green because there are only two green balls. Thus the probability of at least one red ball is . At least two red balls means , so
The sole green ball comes from the first bag exactly on the event . Divide this joint probability by the conditioning event's probability:
This is the conditional probability form of Bayes' theorem.
A double six has probability on each independent throw. For Alice to win on her second turn, her first throw and Bob's first throw must both fail, then her second throw must succeed. Therefore
Write . Alice wins on her st turn if complete rounds fail and then she succeeds. These disjoint events give the geometric series
Consequently
The probability of never obtaining a winner is . The small advantage over comes from taking the first turn.
A uniformly shuffled deck makes all unordered five-card hands equally likely, giving possible hands. Choose the rank appearing four times in ways; all four suits of that rank are then fixed. The remaining card can be any of the other cards. No hand is counted twice, because five cards cannot contain two different complete four-card ranks. This use of combinatorics gives the probability
Here is a binomial coefficient; the probability also simplifies to .
Assume that wrong-note events are independent events and that each note has the same error probability , with . Then their count has a binomial distribution. Choose the mistaken positions in ways and multiply the probabilities of the errors and correct notes:
The endpoint cases or are understood by continuity, giving deterministic counts. More than half means at least mistakes, so
The single-note error probability alone would not determine this count distribution if mistakes were correlated; independence is the additional standard modeling assumption.
For , integrate the probability density function to obtain the cumulative distribution function
If , the requested probability is . Since the hyperbolic tangent is odd, this gives
The second case matters because the question places no sign restriction on : the event is empty when its upper endpoint is nonpositive. Using an oriented integral from to a negative would give a negative number, not a probability.