From (1,1) to (3,3): 2 R and 2 U moves → $\binom{4}{2} = 6$

["Understanding Binary Paths: From (1,1) to (3,3) Using $ R $ and $ U $ Moves — A Combinatorial Breakdown ($ \binom{4}{2} = 6 $)", "In combinatorics, one of the most intuitive and widely illustrated problems is calculating the number of distinct paths from a starting point to a destination on a grid using only right ($ R $) and up ($ U $) moves. A classic example is moving from coordinate (1,1) to (3,3) on a 2D grid. This seemingly simple movement problem reveals deep connections to binomial coefficients — specifically, $ \binom{4}{2} = 6 $.", "---", "### The Grid Journey: (1,1) to (3,3)", "To reach (3,3) from (1,1), you must move:", "- 2 units right: needing 2 $ R $ moves\n- 2 units up: needing 2 $ U $ moves", "Thus, the entire path consists of a total of 4 moves: two $ R $ and two $ U $. The challenge is determining how many different sequences of these moves produce a valid path.", "---", "### Why It’s a Combinatorial Counting Problem", "Each unique path corresponds to a unique permutation of the multiset {R, R, U, U}. Since the moves are not all distinct, we cannot simply use $ 4! $. Instead, we divide by permutations of identical items to avoid overcounting.", "The formula for permutations of a multiset is:", "$$\n\ ext{Number of unique arrangements} = \frac{n!}{r_1! \cdot r_2! \cdot \ldots}\n$$", "Where:\n- $ n $ = total number of moves (4),\n- $ r_1, r_2 $ = counts of repeated moves (2 R's and 2 U's).", "So:", "$$\n\frac{4!}{2! \cdot 2!} = \frac{24}{2 \cdot 2} = \frac{24}{4} = 6\n$$", "This confirms there are exactly 6 distinct paths from (1,1) to (3,3) using 2 right ($ R $) and 2 up ($ U $) moves.", "---", "### The Combinatorial Formula: $ \binom{4}{2} = 6 $", "Instead of expanding permutations, we can think in terms of choosing positions for the right moves (or up moves) within the sequence.", "Suppose we fix the order in which $ R $’s appear. Choosing 2 positions out of 4 for the $ R $ moves automatically determines where the $ U $ moves go — the rest.", "This is the essence of the binomial coefficient:", "$$\n\binom{4}{2} = \frac{4!}{2! \cdot (4-2)!} = \frac{4!}{2! \cdot 2!} = 6\n$$", "Thus, $ \binom{4}{2} = 6 $ directly gives the number of valid $ R, U $ sequences from (1,1) to (3,3).", "---", "### Real-World Applications and Visual Insights", "Understanding such combinatorial paths is crucial in fields ranging from:", "- Robotics: Planning movement on grid-based terrains\n- Computer Science: Generating and analyzing algorithmic paths in dynamic programming\n- Probability & Statistics: Modeling random walks with constrained steps\n- Combinatorial Optimization: Solving problems involving selection and arrangement", "Visually, each path can be plotted as a lattice path on a grid, with 6 unique “routes” winding through 2 right steps and 2 up steps.", "---", "### Summary", "From (1,1) to (3,3), moving only right and up with exactly 2 $ R $ and 2 $ U $ steps, the number of possible paths is mathematically $ \binom{4}{2} = 6 $, reflecting the number of ways to arrange a multiset permutation. This elegant result bridges discrete math and geometry, offering both a practical counting method and a gateway to deeper combinatorial concepts.", "Whether you're coding a navigation algorithm or exploring discrete structures, recognizing these paths equips you with fundamental tools to solve complex problems efficiently.", "---", "Key Takeaway:\nWhen moving between grid points using $ r $ right and $ u $ up moves, the number of distinct paths is $ \binom{r+u}{r} = \binom{r+u}{u} $, always expressible through binomial coefficients for fast, scalable computation.", "---", "Explore further: How do these principles apply in an $ n \ imes n $ grid? Why do binomial coefficients appear beyond 2D? Read on in combinatorics guides and discrete mathematics tutorials."]