Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
str and recursion solution in Clear category for Integer Palindrome by kdim
def int_palindrome(number: int, b: int) -> bool:
tobase = lambda x: tobase(x // b) + chr(x % b) if x else '' # recursively convert to base number
return (number := tobase(number)) == number[::-1]
Sept. 16, 2022
Comments:
