Benford's law for the $3x+1$ function TeX Export

@misc{citeulike:314893, abstract = {We show that for most choices of an initial seed \$x\_0\$, the sequence of the first \$N\$ iterates of \$x\_0\$ under the \$3x+1\$ map approximately satisfies Benford's law.}, archivePrefix = {arXiv}, author = {Lagarias, Jeffrey C. and Soundararajan, K.}, citeulike-article-id = {314893}, citeulike-linkout-0 = {http://arxiv.org/abs/math.NT/0509175}, citeulike-linkout-1 = {http://arxiv.org/pdf/math.NT/0509175}, day = {7}, eprint = {math.NT/0509175}, keywords = {3x1, benford-law}, month = {Sep}, posted-at = {2005-09-09 16:07:01}, priority = {2}, title = {Benford's law for the \$3x+1\$ function}, url = {http://arxiv.org/abs/math.NT/0509175}, year = {2005} }

TY - ELEC ID - citeulike:314893 L3 - citeulike-article-id:314893 N2 - We show that for most choices of an initial seed $x_0$, the sequence of the first $N$ iterates of $x_0$ under the $3x+1$ map approximately satisfies Benford's law. TI - Benford's law for the $3x+1$ function KW - 3x1 KW - benford-law AU - Lagarias, Jeffrey AU - Soundararajan, K PY - 2005/Sep/07/ UR - http://arxiv.org/abs/math.NT/0509175 ER -