Solution: This is a surjective function problem: count the number of ways to partition 7 distinct species into 4 non-empty habitats. Using the inclusion-exclusion principle: $ \sum_{k=0}^4 (-1)^k \binom{4}{k} (4 - k)^7 $. Calculating: $4^7 - \binom{4}{1}3^7 + \binom{4}{2}2^7 - \binom{4}{3}1^7$. Compute each term: $16384 - 4 \times 2187 + 6 \times 128 - 4 \times 1 = 16384 - 8748 + 768 - 4 = 8400$. The final answer is $\boxed{8400}$.**Question:
["Summing Species to Habitats: Counting Distinct Species Partitions Using the Inclusion-Exclusion Principle", "In combinatorics, one often encounters problems that involve dividing distinct objects into non-empty groups—a concept crucial in biology, computer science, and statistics. A classic example is determining how many ways to assign 7 distinct species into 4 non-empty natural habitats, ensuring no habitat remains vacant. This problem is elegantly solved using the inclusion-exclusion principle, offering a powerful formula to compute such partitions.", "### Understanding the Problem", "We aim to count the number of ways to assign 7 distinct species into 4 non-empty habitats—meaning each habitat receives at least one species. Since species are distinct and habitats are distinguishable (e.g., different geographic zones), we are dealing with onto functions from a set of 7 species to a set of 4 habitats.", "This directly corresponds to counting surjective functions, where every habitat (input) receives at least one species (output). The number of such functions from a set of size ( n ) to a set of size ( k ) is given by:", "[\n\sum_{k=0}^n (-1)^k \binom{n}{k} (n - k)^m\n]", "In our case, ( m = 7 ) (species) and ( n = 4 ) (habitats). Applying inclusion-exclusion:", "[\n\sum_{k=0}^4 (-1)^k \binom{4}{k} (4 - k)^7\n]", "### Step-by-Step Calculation", "Start by expanding the sum:", "[\n\binom{4}{0} \cdot 4^7 - \binom{4}{1} \cdot 3^7 + \binom{4}{2} \cdot 2^7 - \binom{4}{3} \cdot 1^7\n]", "Now compute each term:", "- ( 4^7 = 16384 )\n- ( \binom{4}{1} = 4 ), ( 3^7 = 2187 ) → ( 4 \ imes 2187 = 8748 )\n- ( \binom{4}{2} = 6 ), ( 2^7 = 128 ) → ( 6 \ imes 128 = 768 )\n- ( \binom{4}{3} = 4 ), ( 1^7 = 1 ) → ( 4 \ imes 1 = 4 )", "Now substitute:", "[\n16384 - 8748 + 768 - 4 = (16384 - 8748) + 768 - 4 = 7640 + 768 - 4 = 8400\n]", "### Final Result", "The total number of valid ways to assign 7 distinct species into 4 non-empty habitats is:", "[\n\boxed{8400}\n]", "This precise count demonstrates the power of the inclusion-exclusion principle in solving complex distribution problems efficiently. Whether modeling ecological niches or assigning resources, this combinatorial approach delivers accurate, scalable solutions."]
