Skip to main content

Probability I · Probability spaces, axioms, and rigorous counting

Choose a three-element subset uniformly from {1,…,9}, and let M be its largest element

Problem

Probability I practice problem

Choose a three-element subset uniformly from {1,…,9}\{1,\ldots,9\}, and let MM be its largest element. Count the subsets with M=kM=k for every possible kk, and find Pr⁡(M≤6)\Pr(M\le6) and Pr⁡(M=9)\Pr(M=9).

Use the largest-element argument to prove∑j=rN(jr)=(N+1r+1)\sum_{j=r}^{N}\binom jr=\binom{N+1}{r+1}for integers N≥r≥0N\ge r\ge0.

Hint

Hint

Once the largest element is fixed, it is no longer a choice.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

Create a free account to check your answer and see the solution. Create a free account.

More Probability I practice problems

Back to Probability I

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.