Let count rotten pieces. Each item supplies an independent Bernoulli trial with success probability , so has a binomial distribution with parameters . There are choices of the rotten items, and each such choice has probability . Hence
For or , interpret this as the corresponding distribution concentrated at zero or ten; no ambiguous evaluation is needed.
To find the probability of exactly one pair, choose its repeated face in six ways, the distinct face in five ways, and which of the three dice has that distinct face in three ways. Hence
As a check, the disjoint events exhaust the sample space, and .
Choose the first face in six ways, the second in five ways avoiding the first, and the third in four ways avoiding both. Thus
Each ordered outcome is equally likely in this sample space, so dividing the count by gives the probability.
Passing corresponds to in the normalized variable from part (i). Integrating its probability density,
The complementary probability of detecting the fault in one test is also .
The probability density is symmetric about , vanishes at and , and has its single maximum at . It is zero outside that interval. Its area is one: with the dimensionless change of variables
normalization is .
Figure 1.
Coffee-volume density and the two-cup tail region
. Original graphs. Left: the density with the passing interval shaded. Right: transformed independent cup volumes and the triangular region used for the probability in part (b). Details.
Let count tests up to and including the first failure. By independence of random variables, the event requires passes and then a failure. With pass probability and failure probability , this is the geometric distribution
Using part (iii), its expected value is
This counts the test that discovers the fault. The expected number of earlier passing tests alone would be one.
Apply the same dimensionless transformation independently to the two cups, giving . The total-volume condition becomes . Since neither variable can exceed , this region has and , the triangle shown above.
By independence of random variables, the joint probability density is . The desired double integral is
Thus
Boundary equality has probability zero for these continuous random variables.
Put . The function graph is symmetric about the vertical axis, zero outside , and has its unique maximum at with height . On , it decreases as ; the negative side is its reflection. The one-sided interior endpoint values are , so the probability density function jumps to zero at both ends of its support. It also has a corner at its central maximum because of the absolute value in the exponent.
Figure 1.
The symmetric density in Question 16, including its central corner and endpoint jumps
. Details.
Values assigned exactly at do not affect any probability.
Let be the independent avocado count. There are three disjoint ways to have fewer than two total trees: no trees, only one avocado, or only one lemon. Their probabilities give
The sum is generally a Poisson binomial distribution, rather than a single binomial distribution, because the two success probabilities may differ.
There are three possible count pairs conditional on two trees. Their probabilities, from the two independent binomial distributions, are
The first two correspond to matching kinds, so the conditional probability is
This form remains valid at endpoints whenever the conditioning event has positive probability; if the denominator vanishes, the conditional probability is undefined. As a check, when the result is , the fraction of two-element subsets containing matching kinds.
For independent seeds the probability of at least one success is . Requiring it to be at least gives . For , taking logarithms and dividing by the negative number reverses the inequality:
The smallest permitted integer is therefore
The ceiling function is necessary because seeds are counted discretely. If , no finite number suffices; if , one seed suffices. The target is interpreted as at least a ninety-five percent chance, since exact equality may not be attainable with an integer count.
The requested bounds are and , both within the support. Since the probability distribution is continuous, endpoints have zero probability, and subtraction of the cumulative distribution function gives
This leaves the answer in rational fractions as requested.
Interchanging the two colours preserves the probability distribution when their population counts are equal. Thus the probability of two black balls is also . The three mutually exclusive possibilities are two white, two black, or different colours, so
With white balls, uniform sampling without replacement gives the probability
Rearranging, , so
A finite admissible population has even and , so the denominator is nonzero.
The probability of two black balls is the complement of the other two possibilities:
The probability of equal colours is . Thus the required conditional probability is
This is defined when the conditioning event has positive probability. If with one ball of each colour, that event is impossible and the conditional probability is undefined.
The probability that the first ball is white is . Partitioning that event according to the second colour shows that . Uniform sampling without replacement makes the two draw positions exchangeable, so . Therefore
For a direct count, the same value is .
With equally many balls of each colour, uniform sampling without replacement gives
Here an admissible population producing positive probability for three white balls has even , so the cancellation is legitimate. Equating this to gives , hence