Maths Olympiad Prep

Track / Stage 5 / 255 of 400 #1335 of 2444

Problem 1335

AIME late
Number theory Difficulty 5.6 Prove it Philippine Mathematical Olympiad · Philippines

How many ways are there to arrange four 33's and two 55's into a six-digit number divisible by 1111?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

From the divisibility rule for 1111, we know that the difference of the sum of the odd-positioned digits and the even-positioned digits must be equal to a multiple of 1111. The only way this can happen here is that if 33's and 55's are equally distributed over odd and even positions, i.e., two 33's and one 55 will have odd positions, and two 33's and one 55 will have even positions. In the odd positions, there are exactly three ways to arrange them, and same for the even positions. Hence, the number of eligible six-digit numbers is 32=93^{2} = 9. As a check, we can enumerate them all: 333355333355, 333553333553, 335533335533, 355333355333, 553333553333, 335335335335, 353353353353, 533533533533, 533335533335.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.