On the Uniformity of $(3/2)^n$ Modulo 1
Paula Neeley, Daniel Taylor‐Rodríguez, J. J. P. Veerman, Thomas E. Roth
Abstract
Open-access reader
Paula Neeley, Daniel Taylor‐Rodríguez, J. J. P. Veerman, Thomas E. Roth
Abstract
Open-access reader
It has been conjectured that the sequence $(3/2)^n$ modulo $1$ is uniformly distributed. The distribution of this sequence is signifcant in relation to unsolved problems in number theory including the Collatz conjecture. In this paper, we describe an algorithm to compute $(3/2)^n$ modulo $1$ to $n = 10^8$. We then statistically analyze its distribution. Our results strongly agree with the hypothesis that $(3/2)^n$ modulo 1 is uniformly distributed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It has been conjectured that the sequence $(3/2)^n$ modulo $1$ is uniformly distributed. The distribution of this sequence is signifcant in relation to unsolved problems in number theory including the Collatz conjecture. In this paper, we describe an algorithm to compute $(3/2)^n$ modulo $1$ to $n = 10^8$. We then statistically analyze its distribution. Our results strongly agree with the hypothesis that $(3/2)^n$ modulo 1 is uniformly distributed.
Key concepts: Modulo, Sequence (biology), Collatz conjecture, Conjecture, Mathematics, Combinatorics, Distribution (mathematics), Modulo operation