English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Erd\H{o}s conjectured that 1, 4, and 256 are the only powers of two whoseternary representations consist solely of 0s and 1s. Sloane conjectured that,except for $\{2^0,2^1,2^2,2^3,2^4,2^{15}\}$, every other power of two has atleast one 0 in its ternary representation. In this paper, numerical results aregiven in strong support of these conjectures. In particular, we verify bothconjectures for all $2^n$ with $n \leq 2 \cdot 3^{45} \approx 5.9 \times10^{21}$. Our approach makes use of a simple recursive construction of numbers$2^n$ having prescribed patterns in their trailing ternary digits.

On two conjectures concerning the ternary digits of powers of two