rectangular grid of streets has m north-south streets, n east-west streets
Source: 1972 Swedish Mathematical Competition p2
March 26, 2021
combinatorial geometrycombinatorics
Problem Statement
A rectangular grid of streets has north-south streets and east-west streets. For which is it possible to start at an intersection and drive through each of the other intersections just once before returning to the start?