Tie random ends: How many loops?

Key Concepts

• Random Graph Theory: The study of properties of graphs generated by random processes.
• Stochastic Process: A mathematical object defined as a family of random variables, here representing the sequential tying of string ends.
• Expected Value: The long-run average value of repetitions of the same experiment.
• Loop Formation: The topological result of connecting two ends of the same string segment.

---

The String-Tying Puzzle

The puzzle presents a scenario involving $n$ pieces of string placed in a box. Each piece of string has two ends, resulting in $2n$ total endpoints. The process involves:

1. Randomly selecting two available endpoints from the box.
2. Tying these two ends together.
3. Repeating this process until no free endpoints remain.

When two ends of the same string are tied, a closed loop is formed. The objective is to determine the expected number of loops formed when starting with $n = 50$ strings.

Mathematical Framework and Methodology

The problem can be modeled as a sequence of events where each step reduces the number of available endpoints by two.

• Initial State: $2n$ endpoints.
• Step-by-Step Process:
  • At any given step, there are $k$ remaining endpoints.
  • When picking two ends, there is a probability that the two ends belong to the same string segment versus different segments.
  • As the process continues, the probability of forming a loop changes based on the number of strings already connected and the number of free ends remaining.
• The Recursive Logic: The problem asks for the expected value $E[L_n]$, where $L_n$ is the number of loops formed from $n$ strings. By analyzing the transition from $n$ to $n-1$ strings, one can derive a recurrence relation to solve for the average number of loops.

Key Arguments and Observations

• End Condition: The process is guaranteed to terminate when all $2n$ endpoints have been tied, resulting in a collection of disjoint loops.
• Randomness: Because the selection of ends is entirely random, the formation of loops is a probabilistic outcome rather than a deterministic one. The "average" requested implies the calculation of the expected value across all possible permutations of tying.
• Complexity: While the example provided uses $n=10$ (resulting in 3 loops in the specific instance shown), the puzzle asks for the generalized expectation for $n=50$.

Puzzle Solution Strategy

The narrator notes that solutions to these monthly puzzles are not provided in individual videos. Instead, they are aggregated into long-form content based on thematic similarities or shared problem-solving tactics.

• Resource for Solutions: The creator directs viewers to their Patreon page. This platform serves as a hub for:
  • Previews of solutions.
  • Feedback loops to refine the mathematical explanations before they are finalized in long-form videos.
• Rationale: This methodology is intended to provide a more cohesive learning experience, grouping problems that require similar mathematical intuition or heuristics.

Synthesis

The puzzle is a classic application of probability and combinatorics. By starting with $n$ strings and performing $n$ tying operations, the system transitions from a set of linear segments to a set of closed loops. The core challenge lies in calculating the expected number of loops, which requires understanding how the probability of closing a loop evolves as the number of available endpoints decreases. The solution to this specific puzzle ($n=50$) is part of a broader pedagogical approach where the creator bundles complex mathematical problems to highlight underlying patterns in problem-solving.