Maths Olympiad Prep

Track / Stage 6 / 60 of 400 #1060 of 1964

Problem 1060

National Olympiad, first round
Number theory Difficulty 6.0 Prove it

* Problem\text{* Problem} 8}

A six digit (decimal) number has six different digits, none of them 0 , and is divisible by 37 . Show that you can obtain at least 23 other numbers which are divisible by 37 by permuting the digits.

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\text{* Solution}

Suppose the digits are a1,a2,a3,a4,a5,a6a_{1}, a_{2}, a_{3}, a_{4}, a_{5}, a_{6} and that a1a2a3a4a5a6a_{1} a_{2} a_{3} a_{4} a_{5} a_{6} is divisible by 37 . We claim that a2a3a4a5a6a1a_{2} a_{3} a_{4} a_{5} a_{6} a_{1} is also divisible by 37. Put n=a2a3a4a5a6an=a_{2} a_{3} a_{4} a_{5} a_{6} a and m=a1m=a_{1}. The original number is 105 m+n10^{5} \mathrm{~m}+\mathrm{n} and the derived number is 10n+m10 \mathrm{n}+\mathrm{m}. But 37 divides 103110^{3}-1 and hence also 106110^{6}-1 and m(1061)\mathrm{m}\left(10^{6}-1\right). So it also divides 10(105 m+n)m(1061)=10n+m10\left(10^{5} \mathrm{~m}+\mathrm{n}\right)-\mathrm{m}\left(10^{6}-1\right)=10 \mathrm{n}+\mathrm{m}, which proves the claim

Iterating, we get the original number and 5 others:

```

a
a 2 @subsup a 4 @subsup a 5 @subsup a 6 @subsup a 1\text{a 2 @subsup a 4 @subsup a 5 @subsup a 6 @subsup a 1}
a3a
a
a @subsup 6 *\text{a @subsup 6 *}
a

```

Similarly, we have that a1a2a3a4a5a6a1a2a6a4a5a3=(a6a3)999a_{1} a_{2} a_{3} a_{4} a_{5} a_{6}-a_{1} a_{2} a_{6} a_{4} a_{5} a_{3}=\left(a_{6}-a_{3}\right) 999, so a1a2a6a4a5a3a_{1} a_{2} a_{6} a_{4} a_{5} a_{3} is also divisible by 37 . Iterating we get:

a1a2a6a4a5a3a_{1} a_{2} a_{6} a_{4} a_{5} a_{3}

a2a6a4a5a3a1a_{2} a_{6} a_{4} a_{5} a_{3} a_{1}

a6a4a5a3a1a2a_{6} a_{4} a_{5} a_{3} a_{1} a_{2}

a4a5a3a1a2a6a_{4} a_{5} a_{3} a_{1} a_{2} a_{6}

a5a3a1a2a6a4a_{5} a_{3} a_{1} a_{2} a_{6} a_{4}

a3a1a2a6a4a5a_{3} a_{1} a_{2} a_{6} a_{4} a_{5}

Similarly, we could swap the first term and the fourth to get:

```

a 4 @subsup 2 *\text{a 4 @subsup 2 *} a
a
a3a
a
a
a

```

or the second and the fifth to get:

a1a5a3a4a2a6a_{1} a_{5} a_{3} a_{4} a_{2} a_{6}

a5a3a4a2a6a1a_{5} a_{3} a_{4} a_{2} a_{6} a_{1}

a3a4a2a6a1a5a_{3} a_{4} a_{2} a_{6} a_{1} a_{5}

a4a2a6a1a5a3a_{4} a_{2} a_{6} a_{1} a_{5} a_{3}

a2a6a1a5a3a4a_{2} a_{6} a_{1} a_{5} a_{3} a_{4}

a6a1a5a3a4a2a_{6} a_{1} a_{5} a_{3} a_{4} a_{2}

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.