Maths Olympiad Prep

Library / /38 of 187

, 2026

Number theory Difficulty 1.1 Junior Prove it Canada

The sum of the digits of the positive
integer 20262026 is 2+0+2+6=102+0+2+6=10. What is the smallest integer
n gt; 2026\text{n gt; 2026} whose digits also have a
sum of 10?
The product of the digits of the integer
313313 is 313=93 \cdot 1 \cdot 3 = 9. How many integers
between 100100 and 999999, including 313313, have the property that the product
of their digits is 99?
The sum of xx, 3x3x and 4y4y is equal to 4848. The average of xx and yy is equal to 3x3x. Determine the ordered pair (x,y)(x,y).

Solution

We look for integers between 20262026 and 21002100 that have a sum of digits of 1010.

Such integers are of the form 20xy20xy
for some digits xx and yy.

Since the sum of the digits is 1010,
then 2+0+x+y=102 + 0 + x + y = 10 or x+y=8x + y = 8.

For 20xy20xy to be greater than 20262026, we need x2x \geq 2.

If x=2x = 2, then y=6y = 6, which gives us the integer
20262026.

To find the next greatest integer, we try x=3x = 3, which gives y=5y = 5.
This gives us the integer 20352035,
which is the smallest integer n gt; 2026\text{n gt; 2026} with the desired property.
Consider the three-digit positive integers abcabc with product of digits equal to 99 (that is, abc=9a \cdot b \cdot c = 9).

Since 9=329 = 3^2, then aa, bb
and cc are either 11, 11, 99
in some order or 11, 33, 33
in some order. (There are no other factors that can be used.)

The possible integers are 119119,
191191, 911911, 133133, 313313, 331331; there are 66 such integers.
Since the sum of xx, 3x3x and 4y4y is equal to 48, then x+3x+4y=48x + 3x + 4y = 48 and so 4x+4y=484x + 4y = 48 or x+y=12x + y = 12.

Since the average of xx and yy is equal to 3x3x, then x+y2=3x\dfrac{x+y}{2} = 3x and so x+y=6xx+y = 6x or y=5xy = 5x.

Substituting y=5xy = 5x into x+y=12x + y = 12, we obtain x+5x=12x + 5x = 12 or 6x=126x = 12 and so x=2x = 2.

Since y=5xy = 5x, then y=10y = 10 and so (x,y)=(2,10)(x,y) = (2,10).

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.