1

Happy 2019,

What's the proof for: any integer number subtracted by its mirror number is always a multiple of 3?

This is, abfc – cfba will always be a multiple of 3 (abfc, integer number).

Thanks

3 Answers3

0

I suggest that you prove and use the followinng lemma: if $n$ is an integer and $s$ is the sum of its digits, then $n-s$ is divisible by $9$.

Aphelli
  • 34,439
0

Hint: You may want to look at the following expression

$$(1000a+100b+10f+c)-(1000c+100f+10b+a)$$

Can you simplify the above expression and reach a conclusion? Note that the same idea applies regardless of how many digits the number has.

KM101
  • 7,176
0

You can write any general number $N_1=abfc$ as

$$=1000a + 100b +10f + c$$

Similarly you can write its mirror $N_2$ as

$$=1000c + 100f +10b + a$$

Subtracting $N_1$ and $N_2$

$$N_1 - N_2= 999a +90b -90f - 999c = 3(333a + 30b - 30f - 333c)$$

As you can see this number is clearly divisible by $3$ irrespective of the values of $a,b,c,f$