Skip to main content
OlympiadHQ

Browse · MathNet

Print

IRL_ABooklet

Ireland number theory

Problem

For any positive integer we denote by the number obtained by writing the digits of from right to left. For instance, if then and if then . Find all positive integers such that .
Solution
If has one digit this is not possible. If has two digits, say , then so that which yields so the numbers are Assume there are numbers with the above property that have digits. Thus, we may write where and are digits and is a positive integer with digits. We may need to include leading zeros in the presentation of . Then, , where is obtained by writing the digits of from right to left. We now have which yields Because , we must have . If then (6) cannot hold because the right-hand side is a multiple of 10 while the left-hand side is not. If we again raise a contradiction since and imply Hence and from (6) we find from which we get Clearly, does not satisfy (7). If , (7) implies . Recall now that and have at most digits, fewer than if contains leading digits equal to zero. Hence, and cannot exceed , the number that consists of digits 9. This contradiction shows that when there is no solution. Hence, the only numbers satisfying the condition in the problem are the two-digit numbers listed above.
Final answer
10, 21, 32, 43, 54, 65, 76, 87, 98

Techniques

OtherIntegersLinear and quadratic inequalities