Find all the co binary numbers in the given range.

Find the number of co-binary palindromes existing between m and n. A co-binary palindrome is a number in which both, the decimal number and its binary conversion are a palindrome.

Examples:

Input: starting number : 300, last number: 315

Output : 313

Code: Python code to find all the co binary numbers in the given range



filter_none

edit
close

play_arrow

link
brightness_4
code

# Python code for co-binary palindromes
  
def convert_into_binary(number):
    return bin(number).replace("0b","")
  
def reverse_it(number):
    number = str(number)
    return number[::-1]
  
def is_palindrome(number):
    if number == int(reverse_it(number)) :
        return True
    else:
        return False
  
# starting number
m = 300
  
# ending number
n = 1000
bin_pals = []
  
for i in range(m,n+1):
    if is_palindrome(i) == True and is_palindrome(
            int(convert_into_binary(i))):
          
        bin_pals.append(i)
          
print(bin_pals)

chevron_right


Output :

[313, 585, 717]


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.