Open Access
- 3 February 2022
- journal article
- research article
- Published by MDPI AG in AppliedMath
- Vol. 2 (1) , 104-117
Abstract
This paper investigates the behavior of rotating binaries. A rotation by r digits to the left of a binary number B exhibits in particular cases the divisibility , where l is the bit-length of B and is the Hamming weight of B, that is the number of ones in B. The integer r is called the left-rotational distance. We investigate the connection between this rotational distance, the length, and the Hamming weight of binary numbers. Moreover, we follow the question under which circumstances the above-mentioned divisibility is true. We have found out and will demonstrate that this divisibility occurs for cycles.
Keywords
This publication has 7 references indexed in Scilit:
- Generalizing Halbeisen's and Hungerbühler's optimal bounds for the length of Collatz cycles to 3 n + c cyclesJournal of Mathematics and Computer Science, 2021
- Rotation-Equivalence Classes of Binary VectorsTatra Mountains Mathematical Publications, 2016
- Automatic Sequences2003
- Optimal bounds for the length of rational Collatz cyclesActa Arithmetica, 1996
- On a Conjecture of Crandall Concerning the qx + 1 ProblemMathematics of Computation, 1995
- On the "3x + 1" ProblemMathematics of Computation, 1978
- Some Remarks on Non-Commutative Extensions of Local RingsNagoya Mathematical Journal, 1959