If 2 wrong answers in a row are made, the game ends.
If the last question is answered(no 2 wrong answers in a row), you win.
Let s(n) be the number of results to allow the player to win in a game of n questions.
Argue that
s(n)=s(n-1)+s(n-2) for n>=3, and s(1)=2, s(2)=3
更新1:
Argue that s(n)=s(n-1)+s(n-2) for n larger or =3, and s(1)=2, s(2)=3
