Math Competition Lecture Series > 2018 Mathcounts State Problems and Solutions

Sprint #19

(1/1)

admin:
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:

Navigation

[0] Message Index