Nobody moves more than two places
Eight runners finish a race in positions to . In a rerun, each runner's new position differs from their old position by at most , i.e. the new order is a permutation of with for all . How many such permutations are there?
Show hints (3)+
- After filling positions , which values must already be used?
- The state is which two of are used: 6 states.
- Band 1 gives Fibonacci; band 2 needs the 6-state transfer.
Answer
Reveal answer →Final answer
400
Create a free account to see the full worked solution and track your progress.
Interview format: Prop Trading, Systematic & Data-Driven Trading