
Related Articles
- Solution: We are partitioning $6$ distinguishable objects (proposals) into $3$ non-empty, indistinct subsets (teams). This is given by the Stirling number of the second kind $S(6,3)$.
- We compute $S(6,3)$ using recurrence:
- $S(6,3) = 3 \cdot S(5,3) + S(5,2)$
- S(6,3) = 3 \cdot 25 + 15 = 75 + 15 = 90
- Thus, the number of ways is $\boxed{90}$.**Question:
- Find the length of the shortest altitude in a triangle with sides measuring 13, 14, and 15 units.