(palindrome) if soldiers arrange in rows of 3,4,5, then last row contains 2,3,5
Source: Mexican Mathematical Olympiad 1991 OMM P2
July 29, 2018
palindromesnumber theory
Problem Statement
A company of soldiers is such that
(i) is a palindrome number (read equally in both directions);
(ii) if the soldiers arrange in rows of or soldiers, then the last row contains and soldiers, respectively.
Find the smallest satisfying these conditions and prove that there are infinitely many such numbers .