Question: A home-schooled student models planetary alignments using 4 distinguishable satellites and 2 identical orbital slots. Each slot can hold any number of satellites, but the slots are indistinguishable. How many distinct configurations are possible?

["Title: How Many Distinct Configurations Can 4 Distinguishable Satellites Occupy 2 Indistinguishable Orbital Slots?", "---", "Answer: A Home-Schooled Student Models Planetary Alignments Using Combinatorics of Indistinguishable Orbital Slots", "When a home-schooled student explores planetary alignments, one fascinating challenge arises: how many distinct ways can 4 distinguishable satellites occupy 2 indistinguishable orbital slots, where each slot can hold any number of satellites? This problem illuminates key concepts in combinatorics—specifically, counting partitions of labeled objects into unlabeled groups.", "---", "### Understanding the Problem Setup", "We are given:", "- 4 distinguishable satellites labeled, say, A, B, C, D.\n- 2 indistinguishable orbital slots, meaning swapping the satellites in one slot with the same configuration in the other produces the same physical arrangement.\n- Each slot can contain any number of satellites—including zero—but the slots themselves are not labeled or distinguishable.", "The goal: count distinct configurations under these constraints.", "---", "### Why Indistinguishable Slots Matter", "For distinguishable containers, the total arrangements are simple: each satellite has 2 choices, so (2^4 = 16) configurations. But since the slots are indistinguishable, two arrangements are the same if one can be relabeled to match the other—effectively reducing the count.", "---", "### Counting Distinct Configurations: The Combinatorial Approach", "We classify configurations not by slot labels but by partition patterns—how many satellites are in each slot. Since slots are unlabeled, only the distribution matters, ignoring slot order.", "Let’s denote a configuration as (a, b), where a ≤ b to enforce indistinguishability (since swapping the two slots gives the same setup). Here, a + b = 4, and a ≤ b.", "#### Enumerating Valid (a, b) Partitions", "| Satellites in First Slot | Satellites in Second Slot | Distribution (a, b) |\n|--------------------------|---------------------------|---------------------|\n| 0 | 4 | (0, 4) |\n| 1 | 3 | (1, 3) |\n| 2 | 2 | (2, 2) |", "These are all the partitions of 4 satellites into 2 unordered, unlabeled slots. No other partitions exist without repeating (e.g., (3,1) is same as (1,3)).", "---", "### Calculating Number of Distinct Configurations", "Now we compute, for each partition, how many labeled distributions (assignments of specific satellites) correspond to it.", "1. Partition (0, 4):\n All 4 satellites are in one slot. The empty slot has 0.\n Choose which 4 go in the occupied slot: only 1 way (all satellite group).\n Since the clubed group is fixed, no internal permutations matter:\n → 1 distinct config.", "2. Partition (1, 3):\n Choose 1 satellite to be alone in one slot: ( \binom{4}{1} = 4 ) ways.\n The remaining 3 go in the other slot.\n Since slots are indistinct, (1,3) and (3,1) are same—no duplication.\n → 4 distinct configs.", "3. Partition (2, 2):\n Choose 2 satellites to go in one slot: ( \binom{4}{2} = 6 ).\n The remaining 2 go to the other.\n But since the two slots are unlabeled, every group of 2 is counted twice (once for each ordering), so divide by 2:\n → ( \frac{6}{2} = 3 ) distinct configs.", "---", "### Total Number of Distinct Configurations", "Summing all valid cases:", "[\n1\ (\ ext{from } 0,4) + 4\ (\ ext{from } 1,3) + 3\ (\ ext{from } 2,2) = \boxed{8}\n]", "---", "### Real-World Insight: Modeling Planetary Alignments", "This problem mirrors how home-schooled students create physical or digital models of planetary systems—assigning labeled planets (satellites) to indistinct orbital paths. Understanding indistinguishability prevents overcounting alignments that are observationally identical.", "---", "### Conclusion", "By applying combinatorial partitioning—counting unlabeled group distributions—we find that a home-schooled student can model 8 distinct planetary configurations using 4 distinguishable satellites across 2 indistinguishable orbital slots. This elegant blend of geometry, symmetry, and combinatorics demonstrates how simple rules deepen scientific inquiry.", "---", "Keywords: planetary alignments, home-schooled student, distinguishable satellites, indistinguishable slots, combinatorics, partitioning, indistinguishable containers, combinatorial configurations, orbital slots modeling", "Meta Description: Learn how a home-schooled student calculates distinct planetary configurations using 4 distinguishable satellites in 2 indistinguishable orbital slots. Discover the combinatorial math behind planetary alignments.", "---", "Further Reading:\n- “Combinatorics of Indistinguishable Objects”\n- “Partitions of a Set in Discrete Mathematics”\n- “Modeling Celestial Mechanics with Simple Combinatorics”"]