Sam's Math Club
Math Competition Lecture Series => 2018 Mathcounts State Problems and Solutions => Topic started by: admin on April 04, 2018, 06:44:25 PM
-
In the figure, each segment between two adjacent vertices has length 1 unit. How many ways are there to go from A to B along a sequence of 10 segments without touching a side or vertex of the shaded square?
Method 1: water pipe method:
Method 2: counting method: