On two conjectures concerning the ternary digits of powers of two
From MaRDI portal
Publication:5080339
Abstract: ErdH{o}s conjectured that 1, 4, and 256 are the only powers of two whose ternary representations consist solely of 0s and 1s. Sloane conjectured that, except for , every other power of two has at least one 0 in its ternary representation. In this paper, numerical results are given in strong support of these conjectures. In particular, we verify both conjectures for all with . Our approach makes use of a simple recursive construction of numbers having prescribed patterns in their trailing ternary digits.
Recommendations
Cites work
Cited in
(4)
This page was built for publication: On two conjectures concerning the ternary digits of powers of two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080339)