Palindromic Decomposition

Number Theory Level pending

We can define the palindrome P ( n ) P(n) of an integer n n as the integer with the same digits but in reverse :

P ( 1 ) = 1 P ( 124 ) = 421 P ( 1300 ) = 31 P(1) = 1 \\ P(124) = 421 \\ P(1300) = \space 31

Some integers can be written as the sum of n + P ( n ) n+P(n) (e.g. 44 = 13 + 31 44 = 13 + 31 )

Which of these integers cannot be written as the sum of an integer and its palindrome ?

1555 1551 1553 1554

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 solution

Romain Bouchard
Dec 20, 2017

First of all here are the palindromic decompositions for 1551 1551 , 1554 1554 and 1555 1555 :

1551 = 1050 + 501 , 1554 = 579 + 975 1555 = 629 + 926 1551 = 1050 + 501,\\ 1554=579+975 \\ 1555 = 629+926

Now to show that there is no palindromic decomposition for 1553 1553 .

Let's assume there is an integer n n such that n + P ( n ) = 1553 n+P(n)=1553 . There are two possibilities : either n = a b c n=\overline{abc} or n = 1 a b 0 n=\overline{1ab0} .

  • We can exclude directly n = 1 a b 0 n=\overline{1ab0} because the unit digit would be 1 1 and not 3 3 .

  • If n = a b c n=\overline{abc} then we have a b c + c b a = 1553 \overline{abc}+\overline{cba}=1553 which means that a + c a+c should be equal to either 15 15 with b < 5 b<5 or to 14 14 with b > 5 b>5 . In both cases the unit digit will never be 3 3 so there is no solution either with n = a b c n=\overline{abc} .

You didn't show that 1553 1553 cannot be written as n + P ( n ) n+P(n) , you just show that other number can.

Chan Tin Ping - 3 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...