olymmath

SE-SKOLORNAS 1972 Problem 2

    A rectangular grid of streets has mm north-south streets and nn east-west streets. For which m,n>1m, 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?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator se-skolornas/1972/p2 · Tag 3N277SE855 · Edit this page on GitHub · Keys: j next, k previous