References
- APPLEGATE, D.—LAGARIAS, J.: Lower bounds for the total stopping time of 3x+1 iterates, Math. Comput. 72 (2002), no. 242, 1035–1049.
- BORWEIN, J.,—GIRGENSOHN, R.: Addition theorems and binary expansions, Canad. J. Math. 47 (1995), no. 2, 262–273.
- DOWNEY, R.—GREENBERG, N.—JOCKUSCH, C.—MILANS, K.: Binary subtrees with few labeled paths, Combinatorica 31 (2011), no. 3, 285–303, DOI Link.
- DUBICKAS, A.—MOSSINGHOFF, M. J.: Lower bounds for Z-numbers, Math. Comput. 78 (2009), no. 267, 1837–1851.
- LAGARIAS, J.: The Ultimate Challenge: The 3x+1 Problem. American Mathematical Society, Providence, RI, 2010.
- LAGARIAS, J.—WEISS A.: The 3x+1 problem: two stochastic models, Ann. Appl. Probab. 2 (1992), no. 1, 229–261.
- [7]
MAHLER, K.: An unsolved problem on the powers of
{3 \over 2} - MILANS, K.: Extremal problems on edge-colorings, independent sets, and cycle spectra of graphs, PhD thesis, Department of Mathematics, University of Illinois at Urbana-Champaign, 2010, Proquest Link.
- WEST, D.: Binary subtrees with few path labels, Research Experience for Graduate Students (includes problems posed by K. Milans), UIUC Link, 2008.