This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2022 IMC, 3
Tags: function , counting techniques , generating functions
Let $p$ be a prime number. A flea is staying at point $0$ of the real line. At each minute, the flea has three possibilities: to stay at its position, or to move by $1$ to the left or to the right. After $p-1$ minutes, it wants to be at $0$ again. Denote by $f(p)$ the number of its strategies to do this (for example, $f(3) = 3$: it may either stay at $0$ for the entire time, or go to the left and then to the right, or go to the right and then to the left). Find $f(p)$ modulo $p$.