3^n的二进制表示中的正则性与复杂性
Regularity versus complexity in the binary representation of 3^n
摘要：
我们使用由3^n位组成的网格来激发2-adic数的定义。具体来说，我们在3^（2^n）的比特中展示了对角线条纹，这是这种结构的无穷序列中的第一个。我们的观察是由一个2-adic幂级数序列，提供了一些规律性的3的幂位之间的混乱。一般来说，k^（p^n）的以p为基的表示具有这些特征。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
