Sam's Math Club

Please login or register.

Login with username, password and session length
Advanced search  

News:

SMF - Just Installed!

Author Topic: Sprint #19  (Read 2056 times)

admin

  • Administrator
  • Hero Member
  • *****
  • Posts: 2536
Sprint #19
« 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:
« Last Edit: April 09, 2018, 01:15:26 PM by Administrator »