This pattern breaks, but for a good reason | Moser's circle problem

Moser's circle problem initially tempts viewers with a deceptively simple pattern—2, 4, 8, 16 regions—but the pattern breaks at six points, yielding 31 instead of 32. The video shows that the real solution lies in combinatorics: counting chords as "n choose 2" and interior intersections as "n choose 4," then applying Euler's formula for planar graphs to derive the closed-form expression (1 + \binom{n}{2} + \binom{n}{4}). It then explains the illusion of the powers of two through Pascal's triangle, revealing exactly when and why the pattern fails—first at n=6 and seemingly again at n=10 due to symmetry. The deeper takeaway is a cautionary lesson: numerical patterns must be proven, not assumed, yet even apparent coincidences can be elegantly explained by deeper mathematics.

• ▶ 0:49 Moser's circle problem seems to follow powers of two (2, 4, 8, 16) for up to five points, but with six points it breaks, yielding 31 regions.
• ▶ 1:14 The count depends on point placement, so the problem is studied under the generic case where no three chords intersect at a single point.
• ▶ 2:22 The real question is finding the actual function of n that gives the number of regions, since it is not simply a power of two.

• ▶ 3:02 The total number of chords equals the number of distinct pairs of points, given by "n choose two": n(n−1)/2.

• ▶ 4:32 Each interior intersection point corresponds uniquely to a set of four boundary points, so the number of intersections is "n choose four."

• ▶ 6:01 This formula scales to huge cases: with 100 points, there are "100 choose 4" interior intersection points—about four million—showing how combinatorics makes manual counting unnecessary.

• ▶ 6:18 Euler’s formula for planar graphs, (V - E + F = 2), connects vertices, edges, and regions; it is verified by building graphs incrementally and is the key tool for counting regions cut by chords.
• ▶ 8:28 To apply the formula to the circle problem, every chord intersection becomes a vertex, giving (V = n + \binom{n}{4}), and chopping chords at intersections yields (E = \binom{n}{2} + 2\binom{n}{4} + n), counting the (n) outer arcs.
• ▶ 10:39 Substituting into the adapted inside-the-circle formula (E - V + 1) simplifies to the final closed-form answer: (1 + \binom{n}{2} + \binom{n}{4}).
• ▶ 11:37 The key is to view the formula through Pascal’s triangle, where every entry is a binomial coefficient n choose k.
• ▶ 12:32 Row totals in Pascal’s triangle are always powers of 2 because each entry donates two copies to the next row, doubling the total each time.
• ▶ 13:29 The circle formula 1 + n choose 2 + n choose 4 rearranges to cover the previous row of Pascal’s triangle, explaining why powers of 2 appear; at ▶ 14:17 this fails at n=6 when it misses the last entry by exactly 1, while at ▶ 14:36 n=10 works again because symmetry gives half a power of 2.

• ▶ 14:56 The presenter poses an open challenge: proving whether the final power-of-2 pattern truly ends, possibly via Diophantine equations.

• ▶ 15:09 The solution path is recapped: count chords and intersections using binomial coefficients, apply Euler's formula for a closed-form expression, and link it to Pascal's triangle to explain when and why the powers-of-2 pattern breaks.

• ▶ 15:37 The deeper takeaway: Moser's circle problem is a cautionary tale against trusting numerical patterns without proof, yet it shows that apparent coincidences can still be explained by elegant mathematics.

• ▶ 0:00 1. Moser's Circle Problem and the Real Question (0:00 - 2:39) - - Introduces the apparent pattern, placement dependence, and the deeper real question.
• ▶ 2:39 2. Warm-Up: Counting Chords and Intersections (2:39 - 6:18) - - Counts chords and intersection points, using “n choose four” for intersections.
• ▶ 6:18 3. Euler’s Formula and the Closed-Form Answer (6:18 - 11:29) - - Uses Euler’s formula to count regions and derive the closed-form expression.
• ▶ 11:29 4. Pascal’s Triangle, the Pattern Break, and Symmetry (11:29 - 14:56) - - Connects the formula to Pascal’s triangle, explains why the powers-of-two pattern breaks, and examines n = 10 symmetry.
• ▶ 14:56 5. Challenge Problem and Deeper Takeaway (14:56 - 15:50) - - Poses the open challenge and summarizes the broader mathematical lesson.