On the Binary Representation Form of Certain Integers
The integers considered are of the form \( A=\left(2^{n}-1\right) /\left(2^{n_{1}}-1\right)\left(2^{n_{2}}-1\right) \), where \( n_{1} \) and \( n_{2} \) are coprime integers whose product is \( n \). A simple algorithm for the binary form of \( A \) is given. This has the consequence that pairs of digits at the same distance from each end in the binary form (apart from the first and last) are complementary. The result is applied as follows. A modified binary form of an integer is a binary expression with coefficients 0 and \(\pm 1\), and the arithmetic weight is the smallest number of nonzero terms in any such form. It is shown that the minimum arithmetic weight of the multiples of A up to \( 2^{n}-1 \) is \( \min \left(n_{1}, n_{2}\right) \).
This page was built for publication: On the Binary Representation Form of Certain Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773069)