Question: A GPS-tagged flock of 7 birds migrates along a route divided into 7 segments. Each bird independently selects one segment to rest in, uniformly at random. What is the probability that exactly 3 different segments are used, and each of these 3 segments is used by at least one bird? - Redraw

Understanding the Context

Why This Question Captures U.S. Interest
Recent trends show growing public fascination with animal movement analytics, fueled by GPS-tagged wildlife studies and real-time tracking apps. Simultaneously, the design of this question aligns with how researchers and enthusiasts model decision-making in complex systems—whether birds navigating choice, algorithms allocating resources, or users selecting routes on navigation apps. The specific setup—7 birds, 7 segments, random selection—mirrors practical scenarios in logistics, biodiversity modeling, and even digital behavior tracking, sparking curiosity across academic, environmental, and tech-savvy communities.

How This Probability Problem Works

Key Insights

At its core, the scenario involves 7 birds independently choosing one of 7 segments, with each choice equally probable. The challenge is to calculate the chance that only 3 distinct segments are occupied and every chosen segment hosts at least one bird.

Start by selecting 3 segments out of 7: this offers $\binom{7}{3} = 35$ combinations. For each triad, we compute the number of ways to assign 7 birds to those 3 segments such that each segment contains at least one bird—a classic “occupancy problem.” This involves applying the principle of inclusion-exclusion to count non-empty partitions of 7 birds into 3 groups.

Multiplying combinations by valid distributions gives total favorable outcomes. Dividing by total possible assignments—$7^7$, since each bird has 7 independent choices—yields the final probability.

Common Questions People Wish to Clarify

Final Thoughts

1. Why focus on exactly 3 out of 7 segments?
   Many wonder why limiting the used segments to exactly 3 matters. This specificity mirrors real-world constraints—such as limited nesting sites, targeted resource allocation, or network coverage zones—not random or maximum usage, making the problem both realistic and analytically insightful.

2. Is it possible all 7 birds rest in the same segment?
   No, that outcome is far less probable and excluded by the requirement that exactly 3 segments are used. The math confirms this constraint narrows the probability to a measurable, non-zero event rooted in combinatorial fairness.

3. Does randomness always lead evenly distributed results?
   Not at all—this problem shows how random choices can cluster, and ensuring diversity requires deliberate combinatorics. It illustrates that chance doesn’t guarantee balance,