We have 1 2 × 2 3 = 2 7 6 . If we reverse the numbers, we get 6 7 2 = 3 2 × 2 1 , which is still a true statement.
Does there exist non-palindromes a b c and d e f such that
a b c × d e f = g h i j k and k j i h g = f e d × c b a ?
Note: The letters do not represent distinct digits.
The first digit is non-zero.
Non-palindromes mean that
a
=
c
and
d
=
f
.
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.
1 2 2 × 2 1 3 = 2 5 9 8 6 and 6 8 9 5 2 = 3 1 2 × 2 2 1 .
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 1 0 a + b and 1 0 c + d where a \ne b \ & \ c \ne d .
⟹ ( 1 0 a + b ) ( 1 0 c + d ) = 1 0 0 f + 1 0 g + h ( 1 0 b + a ) ( 1 0 d + c ) = 1 0 0 h + 1 0 g + f
Subtracting the 2 equations yields 9 9 a c − 9 9 b d = 9 9 f − 9 9 h .
By analogy, ac = f \ & \ bd = h and g = a d + b c .
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 < 1 0 . So, as long as a > b \ & \ d > c \ & ac + bd < 10 , there will be a number that suffices your condition.
I hope, this helps. ^^
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.
Problem Loading...
Note Loading...
Set Loading...
]Just choose the numbers so that d e f is the reverse of a b c . Then f e d = a b c and c b a = d e f , and so the identity a b c × d e f = f e d × c b a is trivial. The trick is then to make this common product a palindrome. Since a b c × c b a = 1 0 0 0 0 a c + 1 0 0 0 ( a + c ) b + 1 0 0 ( a 2 + b 2 + c 2 ) + 1 0 ( a + c ) b + a c this can be done easily by ensuring that a c , ( a + c ) b and a 2 + b 2 + c 2 are single digit numbers. Thus { a , c } = { 1 , 2 } (since a , c must be nonzero and distinct), and b = 0 , 1 , 2 . We have the solutions 1 0 2 × 2 0 1 = 2 0 5 0 2 1 1 2 × 2 1 1 = 2 3 6 3 2 1 2 2 × 2 2 1 = 1 6 9 6 2
The same approach will provided the 4 -digit solution 1 1 1 2 × 2 1 1 1 = 2 3 4 7 4 3 2 , with a 4 digit number, times its reverse, equalling a palindrome. We can find a 5 digit solution as well: 1 1 0 1 2 × 2 1 0 1 1 = 2 3 1 3 7 3 1 3 2 . Indeed, we can find an example of any length: 1 n 0 0 . . . 0 2 × 2 n 0 0 . . . 0 1 = 2 n 0 0 . . . 0 5 n 0 0 . . . 0 2
for any nonnegative integer n .