Maths Olympiad Prep

Track / Stage 5 / 208 of 400 #1288 of 2444

Problem 1288

AIME late
Combinatorics Difficulty 5.4 Prove it Harvard-MIT Mathematics Tournament · United States

A horse stands at the corner of a chessboard, a white square. With each jump, the horse can move either two squares horizontally and one vertically or two vertically and one horizontally (like a knight moves). The horse earns two carrots every time it lands on a black square, but it must pay a carrot in rent to rabbit who owns the chessboard for every move it makes. When the horse reaches the square on which it began, it can leave. What is the maximum number of carrots the horse can earn without touching any square more than twice?
Figure 1

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:
The horse must alternate white and black squares, and it ends on the same square where it started. Thus it lands on the same number of black squares (bb) as white squares (ww). Thus, its net earnings will be 2b(b+w)=bw=02b - (b + w) = b - w = 0 carrots, regardless of its path.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.