A marine microplastic remediation specialist is testing 5 different filtration methods on a sample containing 3 types of microplastic particles. In how many ways can the specialist test each method on the particles if each type must be tested by at least one method?
["A marine microplastic remediation specialist is testing 5 different filtration methods on a sample containing 3 types of microplastic particles. In how many ways can the specialist assign each method to test one or more particle types, ensuring that no type is left unexamined? This question is gaining attention amid growing U.S. interest in ocean clean-up innovation and sustainable environmental technologies. As microplastics threaten marine ecosystems and human health, experts are evaluating efficient, scalable solutions—not just one method, but how to optimally combine testing approaches across varied particle forms.", "This scenario presents a classic combinatorial challenge with practical implications: testing 3 microbial particle types using 5 filtration methods while guaranteeing each type is evaluated. The constraint that every particle type must be tested by at least one method mirrors real-world needs for comprehensive, reliable remediation. The math behind this is rooted in partitioning and combinations, offering insight into efficient scientific testing design.", "### How Many Valid Assignments Exist?", "The scenario boils down to counting the number of surjective (onto) mappings from 5 filtration methods to 3 microplastic types, where each particle type appears in at least one method’s test. Mathematically, this corresponds to distributing 5 distinguishable filtration methods across 3 distinguishable particle types so that no type is excluded.", "For such a distribution, the count is calculated using the principle of inclusion-exclusion or Stirling numbers of the second kind followed by permutations:", "\[\n\ ext{Number of ways} = 3! \ imes S(5,3)\n\]", "Where \(S(5,3) = 25\) is the Stirling number representing the number of ways to partition 5 methods into 3 non-empty unlabeled groups, and multiplying by \(3!\) assigns labels (types) to those groups. This commonly yields 150 distinct assignments.", "But slightly adjusted for filtering method application (each method tested on one or more types), a more direct, documented formula gives:", "\[\n\sum_{k=0}^{3} (-1)^k \binom{3}{k} (3-k)^5 = 150 - 90 + 30 - 3 = 87\n\]", "Wait—this total (87) reflects unrestricted assignments with no empty type—error. Correctly, for exactly 3 non-empty groups, from distinguishable filters to distinguishable types (particle categories), the formula is:", "\[\n\sum_{k=0}^{3} (-1)^k \binom{3}{k} (3-k)^5 = 150 - 90 + 30 - 3 = 87 \quad \ ext{(total surjective functions)}\n\]", "But more precisely: When treating methods as assignable to particle types with each type tested at least once, the count is:", "\[\n\ ext{Number of onto functions} = 3^5 - \binom{3}{1} \cdot 2^5 + \binom{3}{2} \cdot"]
