# Add new comment

Weird and wonderful things can happen when you set a ball in motion on a billiard table — and the theory of mathematical billiards has recently seen a breakthrough.

Was vaccinating vulnerable people first a good choice? Hindsight allows us to assess this question.

A game you're almost certain to lose...

What are the challenges of communicating from the frontiers of mathematical research, and why should we be doing it?

Celebrate Pi Day with the stars of our podcast,

*Maths on the move*!

To reach n, i should first reach n-2 or n-1; and to reach n-2, i should reach n-3 or n-2.

Considering this, i will get:

F(n) = F(n-1)+F(n-2)

F(n-1) = F(n-2)+F(n-3)

...

F(2)=2

F(1)=1

This means to reach the n-th step, the number of ways is a Fibonacci number F(n).