Four pretty digits

Today I saw the number 7452 and I thought: that's pretty; from the first to the second digit you go down by three, and from the third to the fourth digit you go down by three.

It turns out that 7452 is not a multiple of 11.

Is there any four-digit number , whose digits are all different, with the property that d 1 d 2 = d 3 d 4 d_1-d_2 = d_3-d_4 (where d 1 d_1 means the first digit and so on) and is a multiple of 11?

If so, type the smallest number with this property. If not, type 0.


The answer is 0.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Arjen Vreugdenhil
Oct 26, 2018

Let the difference d 1 d 2 = d 3 d 4 = : a d_1 - d_2 = d_3 - d_4 =: a .

A number is a multiple of 11 if and only if that is true for the alternating digit sum; that is, d 1 d 2 + d 3 d 4 d_1 - d_2 + d_3 - d_4 must be a multiple of 11. This means that ( d 1 d 2 ) + ( d 3 d 4 ) = 2 a (d_1 - d_2) + (d_3 - d_4) = 2a is a multiple of 11; but since for sure a 9 |a| \leq 9 this is only possible if a = 0 a = 0 . However, that would make d 1 = d 2 d_1 = d_2 and d 3 = d 4 d_3 = d_4 , while we required that all digits are different.

The conclusion is that there are no such numbers.

Chew-Seong Cheong
Oct 27, 2018

Consider a 4-digit integer N = d 1 d 2 d 3 d 4 N = \overline{d_1d_2d_3d_4} . Then

N 1000 d 1 + 100 d 2 + 10 d 3 + d 4 (mod 11) 10 d 1 + d 2 + 10 d 3 + d 4 (mod 11) Let d 1 d 2 = d 3 d 4 = n 10 ( d 2 + n ) + d 2 + 10 ( d 4 + n ) + d 4 (mod 11) where n [ 0 , 9 ] is an integer. 11 ( d 2 + d 4 ) + 20 n (mod 11) 9 n (mod 11) \begin{aligned} N & \equiv 1000d_1 + 100d_2 + 10d_3 + d_4 \text{ (mod 11)} \\ & \equiv 10{\color{#3D99F6}d_1} + d_2 + 10{\color{#3D99F6}d_3} + d_4 \text{ (mod 11)} & \small \color{#3D99F6} \text{Let }d_1 - d_2 = d_3 - d_4 = n \\ & \equiv 10{\color{#3D99F6}(d_2+n)} + d_2 + 10{\color{#3D99F6}(d_4+n)} + d_4 \text{ (mod 11)} & \small \color{#3D99F6} \text{where } n \in [0, 9] \text{ is an integer.} \\ & \equiv 11(d_2+d_4) + 20n \text{ (mod 11)} \\ & \equiv 9n \text{ (mod 11)} \end{aligned}

For N N to be divisible by 11, n = 0 n = 0 or d 1 = d 2 d_1=d_2 and d 3 = d 4 d_3=d_4 . Therefore, there is no 4-digit integer of different digits that has the property. The answer is 0 \boxed 0 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...