Problem #PRU-65275

Problems Probability and statistics Probability theory Discrete distribution Algebra Sequences Recurrent relations Fibonacci numbers

Problem

The figure shows the scheme of a go-karting route. The start and finish are at point \(A\), and the driver can go along the route as many times as he wants by going to point \(A\) and then back onto the circle.

It takes Fred one minute to get from \(A\) to \(B\) or from \(B\) to \(A\). It also takes one minute for Fred to go around the ring and he can travel along the ring in an anti-clockwise direction (the arrows in the image indicate the possible direction of movement). Fred does not turn back halfway along the route nor does not stop. He is allowed to be on the track for 10 minutes. Find the number of possible different routes (i.e. sequences of possible routes).