Easy problem, but with infinite calculations
Source: Brazilian Mathematical Olympiad 2023, Level U, Problem 5
October 21, 2023
modular arithmeticgenerating functionsrecurrence relationalgebra
Problem Statement
A drunken horse moves on an infinite board whose squares are numbered in pairs . In each movement, the 8 possibilities are equally likely. Knowing that the knight starts at , calculate the probability that, after moves, it is in a square with and .