Working In Base Negative 31

Find the smallest 3-digit palindrome which remains a palindrome in base ( 31 ) (-31) and is a multiple of 101.

Clarification : Yes, it is indeed ( 31 ) (-31) and not 31 31 .

Hint : See this problem .


The answer is 404.

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

Caleb Townsend
Mar 17, 2015

From the hints in the problem and problem title, you may be able to guess that the answer is 404. 404. Indeed, when converting to base 31 , -31, 404 31 = 13 , r = 1 13 31 = 1 , r = 13 1 31 = 0 , r = 1 404 = 1 : 13 : 1 31 \frac{404}{-31} = -13, r=\boxed{1} \\ \frac{-13}{-31} = 1, r=\boxed{13} \\ \frac{1}{-31} = 0, r=\boxed{1} \\ 404 = 1:13:1_{-31} which is a palindrome. Repeating the process for 101 , 101, 202 , 202, and 303 , 303, it can be seen that these are not palindromes in base 31. -31. Therefore 404 \boxed{404} is the smallest 3-digit multiple of 101 101 that is a palindrome in base 31. -31.

I also love how the link points that out. :v

Joeie Christian Santana - 6 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...