MathDB

2

Part of 1991 Mexico National Olympiad

Problems(1)

(palindrome) if soldiers arrange in rows of 3,4,5, then last row contains 2,3,5

Source: Mexican Mathematical Olympiad 1991 OMM P2

7/29/2018
A company of nn soldiers is such that (i) nn is a palindrome number (read equally in both directions); (ii) if the soldiers arrange in rows of 3,43, 4 or 55 soldiers, then the last row contains 2,32, 3 and 55 soldiers, respectively. Find the smallest nn satisfying these conditions and prove that there are infinitely many such numbers nn.
palindromesnumber theory