Combinatorics Challenge: Astronaut Assignment with Experience Requirements

What This Problem Teaches

• Constraint-based combinatorics — Breaking complex counting problems into manageable cases
• Strategic case analysis — Systematically considering all ways a constraint can be satisfied
• Combination calculations with dependencies — Understanding how one choice affects subsequent possibilities
• Multi-group assignment — Counting arrangements when people must be distributed among different containers
• Mathematical modeling — Translating real-world constraints into precise mathematical conditions

Solution: Method 1 — Case-by-Case Analysis

The key insight is that all 4 experienced astronauts must go, but we have flexibility in how they're distributed between the rockets. Let's systematically consider each possible split.

Step 1 — Identify the constraint scenarios

Since all 4 experienced astronauts must go and there are 7 total seats (3 + 4), we need to determine how many experienced astronauts go on each rocket. Let x = experienced astronauts on Rocket 1 (3 seats) and y = experienced astronauts on Rocket 2 (4 seats).

We have x + y = 4 with constraints 0 ≤ x ≤ 3 and 0 ≤ y ≤ 4.

The valid cases are:

• Case 1: x = 1, y = 3 (1 experienced on Rocket 1, 3 on Rocket 2)
• Case 2: x = 2, y = 2 (2 experienced on each rocket)
• Case 3: x = 3, y = 1 (3 experienced on Rocket 1, 1 on Rocket 2)

Step 2 — Calculate Case 1 (1 experienced on Rocket 1)

Choose 1 experienced astronaut for Rocket 1: C(4,1) = 4 ways

Fill remaining 2 seats on Rocket 1 with regular astronauts: C(8,2) = 28 ways

Rocket 2 gets the remaining 3 experienced + 1 regular: C(6,1) = 6 ways

Step 3 — Calculate Case 2 (2 experienced on each rocket)

Choose 2 experienced for Rocket 1: C(4,2) = 6 ways

Fill remaining 1 seat on Rocket 1 with regular astronaut: C(8,1) = 8 ways

Rocket 2 gets remaining 2 experienced + 2 regular: C(7,2) = 21 ways

Step 4 — Calculate Case 3 (3 experienced on Rocket 1)

Choose 3 experienced for Rocket 1: C(4,3) = 4 ways

Rocket 1 is now full (3 seats filled)

Rocket 2 gets the remaining 1 experienced + 3 regular: C(8,3) = 56 ways

Step 5 — Sum all valid cases

Solution: Method 2 — The Complement Approach

Instead of thinking about how to split the experienced astronauts, let's think about selecting the 7 astronauts who will fly and then assigning them to rockets.

Step 1 — Select the flying crew

We must take all 4 experienced astronauts, plus 3 more from the 8 regular astronauts.

Ways to choose 3 regular astronauts from 8: C(8,3) = 56

Step 2 — Assign the 7 selected astronauts to rockets

Now we have 7 astronauts (4 experienced, 3 regular) to assign to Rocket 1 (3 seats) and Rocket 2 (4 seats).

This is equivalent to choosing 3 people for Rocket 1 from the 7 selected astronauts.

Ways to choose 3 for Rocket 1: C(7,3) = 35

Step 3 — Apply the constraint check

But wait! We need to subtract cases where no experienced astronauts go on one of the rockets, since all experienced must fly.

Invalid arrangements:

• All 4 experienced on Rocket 2: Choose 3 regular for Rocket 1 = C(3,3) = 1 way
• All 4 experienced on Rocket 1: Impossible since Rocket 1 only has 3 seats

Verification

Let's verify our answer using the constraint that exactly 7 astronauts fly (4 experienced + 3 regular) and check our case breakdown:

We can also verify that our cases are exhaustive and mutually exclusive. Every valid assignment must have between 1 and 3 experienced astronauts on Rocket 1 (since 0 would violate the constraint that all experienced must go, and 4 exceeds Rocket 1's capacity). Our three cases cover exactly these possibilities with no overlap.

Common Pitfalls

The Underlying Pattern

This problem illustrates a fundamental principle in combinatorics: constraint-driven case analysis. When faced with restrictions like "all experienced must go," the solution strategy is:

1. Identify the constraint variable — Here, how many experienced astronauts go on each rocket
2. Enumerate valid values — The constraint creates natural boundaries for case analysis
3. Calculate each case independently — Each scenario has its own counting formula
4. Sum the cases — The total is the sum since cases are mutually exclusive

The general formula for this type of problem is:

This pattern appears whenever you have a required subset that must be distributed among multiple groups with limited capacity.

Where This Shows Up in Real Life

• Clinical trials — Ensuring each treatment group has required specialists while randomizing other participants
• Project team formation — Distributing senior engineers across multiple teams while filling remaining roles
• Military deployment — Assigning officers to units while ensuring leadership requirements are met
• Academic committees — Distributing tenured faculty across committees with specific expertise requirements

What If?