Let m<n be positive integers. Start with n piles, each of m objects. Repeatedly carry out the following operation: choose two piles and remove n objects in total from the two piles. For which (m ,n) is it possible to empty all the piles?
【译】设正整数m<n.起初一共有n 堆石子,每堆有 m块石子. 重复执行以下操作: 选择两堆石子,从这两堆中移除共n 块石子.问:对于怎样的 (m , n),可以移除所有石子?