Abstract
The aim of this paper is to describe a new method for searching all binary palindromes that have a given number of the binary digits. The main result is presented in the form of an algorithm. The obtained algorithm is based on the use of the regularity revealed in the course of the study, based on the application of basic arithmetic operations with palindromes that have a various number of the binary digits. The paper also provides examples of using this algorithm to obtain binary palindromes with different number of the binary digits. The algorithm formulated here can be applied to analyse computer data written in the form of a binary code.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
