Regularity versus complexity in the binary representation of 3ⁿ

MaRDI QIDQ5188210zbMATH OpenFDO

Authors Eric Rowland

Publication date 10 March 2010

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

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Dynamical aspects of cellular automata (37B15)

Abstract: We use the grid consisting of bits of 3^n to motivate the definition of 2-adic numbers. Specifically, we exhibit diagonal stripes in the bits of 3^(2^n), which turn out to be the first in an infinite sequence of such structures. Our observations are explained by a 2-adic power series, providing some regularity among the disorder in the bits of powers of 3. Generally, the base-p representation of k^(p^n) has these features.

Recommendations

• Bits of 3ⁿ in binary, Wieferich primes and a conjecture of Erdős
• Binary sequences. III: Complexity versus homogeneity and symmetry
• The 2-adic, binary and decimal periods of \(1/3^k\) approach full complexity for increasing \(k\)
• Linear complexity of ternary sequences formed on the basis of power residue classes
• On the 2-adic complexity of cyclotomic binary sequences of order three
• scientific article; zbMATH DE number 4102989
• A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
• Binary representations of finite fields and their application to complexity theory
• The complexity of ODD_n^A

Cited in

(4)

• Integer powers in binary
• \(p\)-adic asymptotic properties of constant-recursive sequences
• The 2-adic, binary and decimal periods of \(1/3^k\) approach full complexity for increasing \(k\)
• Bits of 3ⁿ in binary, Wieferich primes and a conjecture of Erdős

This page was built for publication: Regularity versus complexity in the binary representation of 3^n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188210)