Sequence pairs related to produced graphs from a method for dividing a natural number by two
This work addresses a theoretical problem in number theory or graph theory, but it appears incremental as it builds on existing division algorithms to define new pairs.
The paper tackles the problem of generating MS-pairs using an algorithm for dividing natural numbers by two and analyzing related graphs, resulting in pairs with properties like unpredictability, irreversibility, aperiodicity, and chaotic behavior.
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present some applications of these pairs that show their interesting properties such as unpredictability, irreversible, aperiodicity and chaotic behavior.