Explain the Pattern - Part 3

We have 12 × 23 = 276 12 \times 23 = 276 . If we reverse the numbers, we get 672 = 32 × 21 672 = 32 \times 21 , which is still a true statement.

Does there exist non-palindromes a b c \overline{abc} and d e f \overline{def} such that

a b c × d e f = g h i j k \overline{abc} \times \overline{def} = \overline{ghijk} and k j i h g = f e d × c b a \overline{kjihg} = \overline{fed} \times \overline{cba} ?

Note: The letters do not represent distinct digits.
The first digit is non-zero.
Non-palindromes mean that a c a \neq c and d f d \neq f .

No, there does not exist Yes, there exists

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.

3 solutions

Mark Hennings
Oct 24, 2017

]Just choose the numbers so that d e f \overline{def} is the reverse of a b c \overline{abc} . Then f e d = a b c \overline{fed} = \overline{abc} and c b a = d e f \overline{cba} = \overline{def} , and so the identity a b c × d e f = f e d × c b a \overline{abc} \times \overline{def} = \overline{fed} \times \overline{cba} is trivial. The trick is then to make this common product a palindrome. Since a b c × c b a = 10000 a c + 1000 ( a + c ) b + 100 ( a 2 + b 2 + c 2 ) + 10 ( a + c ) b + a c \overline{abc} \times \overline{cba} \; = \; 10000ac + 1000(a+c)b + 100(a^2+b^2+c^2) + 10(a+c)b + ac this can be done easily by ensuring that a c ac , ( a + c ) b (a+c)b and a 2 + b 2 + c 2 a^2+b^2+c^2 are single digit numbers. Thus { a , c } = { 1 , 2 } \{a,c\} = \{1,2\} (since a , c a,c must be nonzero and distinct), and b = 0 , 1 , 2 b=0,1,2 . We have the solutions 102 × 201 = 20502 112 × 211 = 23632 122 × 221 = 16962 102 \times 201 = 20502 \hspace{2cm} 112 \times 211 = 23632 \hspace{2cm} 122 \times 221 = 16962

The same approach will provided the 4 4 -digit solution 1112 × 2111 = 2347432 1112 \times 2111 = 2347432 , with a 4 4 digit number, times its reverse, equalling a palindrome. We can find a 5 5 digit solution as well: 11012 × 21011 = 231373132 11012 \times 21011 = 231373132 . Indeed, we can find an example of any length: 1 00...0 n 2 × 2 00...0 n 1 = 2 00...0 n 5 00...0 n 2 1\underbrace{00...0}_{n}2 \times 2\underbrace{00...0}_{n}1 \; = \; 2\underbrace{00...0}_{n}5\underbrace{00...0}_{n}2

for any nonnegative integer n n .

Chung Kevin
Oct 21, 2017

122 × 213 = 25986 122 \times 213 = 25986 and 68952 = 312 × 221 68952 = 312 \times 221 .

I do not know how to find this other than trial and error. The numbers seem similar to the 2 digit case, but I don't think it's special.

Does a 4-digit pattern also exist?

I have a solution (for two digit) , but I guess, it will also be applicable for 3-digit and more.

Let the 2 numbers be 10 a + b 10 a + b and 10 c + d 10 c + d where a \ne b \ & \ c \ne d .

( 10 a + b ) ( 10 c + d ) = 100 f + 10 g + h ( 10 b + a ) ( 10 d + c ) = 100 h + 10 g + f \begin{aligned} \implies &(10a+b)(10c+d) = 100f + 10g + h \\ &(10b+a)(10d + c) = 100h + 10g + f \end{aligned}

Subtracting the 2 equations yields 99 a c 99 b d = 99 f 99 h 99ac - 99bd = 99f - 99h .

By analogy, ac = f \ & \ bd = h and g = a d + b c g = ad + bc .

WLOG, a > b \ & \ d > c \implies ad + bc > ac + bd by rearrangement inequality.

Since g is a one digit number only, then: a c + b d < a d + b c < 10 ac + bd < ad + bc < 10 . So, as long as a > b \ & \ d > c \ & ac + bd < 10 , there will be a number that suffices your condition.

I hope, this helps. ^^

Christian Daang - 3 years, 7 months ago
Samir Betmouni
Dec 3, 2017

I multiplied out (100a + 10b + c)(100d + 10e + f) and then aimed for no carrying into next columns. This lowered the amount of trial and error, since:

ae+bd<10 (for the 1000's column)

af+be+cd<10 (for the hundreds column)

And that was enough to find

123 x 112 = 13776 while 67731 = 211 x 321

I like Mark Hennings solution with ghijk being a palindrome, because it generalises.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...