Problem

Source: 2017 Saudi Arabia BMO TST II p3

Tags: combinatorics



We put four numbers $1,2, 3,4$ around a circle in order. One starts at the number $1$ and every step, he moves to an adjacent number on either side. How many ways he can move such that sum of the numbers he visits in his path (including the starting number) is equal to $21$?