MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

A knight starts on a dark square of a chessboard and makes 25 moves. Counting only the squares it lands on after moves 1,2,…,251, 2, \ldots, 25, how many of them are dark?

Practice more like this