Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. The unnumbered statement headed "3x + 1 Conjecture", p. 2, of Daniel J. Bernstein and Jeffrey C. Lagarias, The 3x+1 conjugacy map, Canad. J. Math. 48 (1996) 1154--1169, with label and page as printed in the authors' retypeset manuscript dated 15 February 1996, the edition read for the source card.
Statement
Throughout, is the function, for and for (1.1), and is the 2-adic shift, for odd and for even (1.2), both on the 2-adic integers (p. 1). The conjugacy map is the unique map with and (pp. 1--2). It is a solenoidal bijection: implies for every (p. 2), so it induces a permutation of (p. 3).
For written as with a finite or infinite sequence, the paper records the explicit formula (1.6), citing [2] (p. 2). Here is the set of positive integers and , read inside .
On p. 1 the paper states the Conjecture as: for each positive integer some iterate equals , that is, all orbits on the positive integers reach the cycle . On p. 2 it says that this conjecture is reformulated, citing its references [2] and [8], as
Conjecture (p. 2). "."
The paper gives the reformulation as known from those references and proves nothing about it; it is a restatement, not a result of this paper.
Proof pointer
None in this paper: the equivalence is attributed to [2] (D. J. Bernstein, Proc. Amer. Math. Soc. 121 (1994), 405--408) and [8] (J. C. Lagarias, Amer. Math. Monthly 92 (1985), 3--23).
Dependencies
The definition of by (1.3) and , and formula (1.6), both on p. 2.
Bears on
- Problem 1135: the problem's map is the paper's restricted to the positive integers, and its question, whether every has for some , is the Conjecture as the paper states it on p. 1. The paper records, from its references [2] and [8], that this conjecture is equivalent to . It is a restatement only; the paper does not prove or disprove either form, and says its own results "are not related to the 3x + 1 Conjecture in any immediate way" (p. 3).