A rectangular grid of streets has m north-south streets and n east-west streets. For which m,n>1 is it possible to start at an intersection and drive through each of the other intersections just once before returning to the start? combinatorial geometrycombinatorics