It has been conjectured that the sequence (3/2)n modulo 1 is uniformly distributed. The distribution of this sequence is significant 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 = 108 . We then statistically analyze its distribution. Our results strongly agree with the hypothesis that (3/2)n modulo 1 is uniformly distributed.
Locate the Document
Neeley, Paula; Taylor-Rodriguez, Daniel; Veerman, J.J.P.; and Roth, Thomas, "On the Uniformity of (3/2)n Modulo 1" (2017). Mathematics and Statistics Faculty Publications and Presentations. 262.
This is the author’s version of a work. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document.