Problem #PRU-30653

Problems Number Theory Divisibility Equations in integer numbers

Problem

A pawn stands on one of the squares of an endless in both directions chequered strip of paper. It can be shifted by \(m\) squares to the right or by \(n\) squares to the left. For which \(m\) and \(n\) can it move to the next cell to the right?