On two conjectures concerning the ternary digits of powers of two

From MaRDI portal
Publication:5080339

zbMATH Open1495.11012arXiv2202.13256MaRDI QIDQ5080339FDOQ5080339


Authors: Robert I. Saye Edit this on Wikidata


Publication date: 31 May 2022

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 20,21,22,23,24,215, 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 2n with nleq2cdot345approx5.9imes1021. Our approach makes use of a simple recursive construction of numbers 2n having prescribed patterns in their trailing ternary digits.


Full work available at URL: https://arxiv.org/abs/2202.13256

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



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)