This paper investigates the behaviour of rotating binaries. A rotation by $r$ digits to the left of a binary number $B$ exhibits in particular cases the divisibility $l\mid N_1(B)\cdot r+1$, where $l$ is the bit-length of $B$ and $N_1(B)$ 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 $kn+c$ cycles.

翻译：本文调查旋转二进制的行为。 在二进制数字为$B$的左侧, 以数位数的位数旋转。 我们调查了二进制数字的旋转距离、 长度和 Hamming 重量之间的关联。 此外, 我们还跟踪了上述二进制数字在何种情况下是真实的。 我们发现并会证明, 美元+c美元周期存在这种差异。