Statement
Setting (pp. 1--3): T(n)=21(3n+1) for odd n and T(n)=21n for
even n, on the natural numbers (p. 1; the map f of Problem 1135). An
m-cycle is a periodic T-sequence whose members fall into m runs, each
an increasing run of odd numbers followed by a decreasing run of even
numbers, so that it has m local minima x0,…,xm−1 (pp. 1--2);
K and L are the numbers of odd and of even members of the cycle (p. 2);
an m-cycle is nontrivial when it contains natural numbers greater than
2 (p. 2), and the m-fold repeated cycle {1,2} is the trivial
m-cycle (p. 2); xmin=min{x0,…,xm−1} for a nontrivial
m-cycle (p. 3); δ=log3/log2 (p. 3). The bound
xmin>X0=5⋅260>5.7646⋅1018 is the verification bound
the paper takes from Oliveira e Silva's computations as of 31 August 2010
(p. 3).
Theorem 3 (Main Theorem) (p. 5), opening sentence quoted: "For an
m-cycle for the 3n+1-problem, let K,L,xmin be defined as above."
- (a) (credited to Brox) For every m there are only finitely many
m-cycles.
- (b) Quoted: "For 1≤m≤75 there do not exist nontrivial m-cycles."
- (c) For 76≤m≤77, the only possible nontrivial m-cycles satisfy
xmin>5.7646⋅1018 and have (K,L) equal to one of the
following pairs, with xmin below the bound given with it:
- m=76: (117972833293231014, 69009683580368485)
with xmin<6.2044⋅1018;
(124207383220472977, 72656661496678846) with
xmin<1.0825⋅1019;
(130441933147714940, 76303639412989207) with
xmin<4.2381⋅1019.
- m=77: the same three pairs, with xmin<6.2860⋅1018,
xmin<1.0967⋅1019 and xmin<4.2939⋅1019
respectively, and
(254649316368187917, 148960300909668053) with
xmin<8.7355⋅1018.
- (d) For m≥78 the possible nontrivial m-cycles satisfy the
following, in four ranges of m:
- 78≤m≤90:
1.1173⋅1017<K<1.3993mδm<e0.46057m+logm+0.33593,
6.1715⋅1016<L<0.81850mδm<e0.46057m+logm−0.20028,
5.7646⋅1018<xmin<339.14m2δm<e0.46057m+2logm+5.8265;
- 91≤m≤515619:
7.5311⋅1011<K<1.4784mδm<e0.46057m+logm+0.39095,
4.4054⋅1011<L<0.86480mδm<e0.46057m+logm−0.14525,
5.7646⋅1018<xmin<5.1825⋅107m2δm<e0.46057m+2logm+17.764;
- 515620≤m≤527875034:
9.0240⋅108<K<15.109mδm<e0.46057m+logm+2.7153,
5.2787⋅108<L<8.8379mδm<e0.46057m+logm+2.1791,
5.7646⋅1018<xmin<e6.1260m;
- m≥527875035:
1.7095m<K<15.108mδm<e0.46057m+logm+2.7152,
m≤L<8.8372mδm<e0.46057m+logm+2.1790,
5.7646⋅1018<xmin<e6.1255m.
The paper adds (p. 5) that for 91≤m≤527875034 the lower bounds
can be refined by Corollary 11 (p. 10), and that the exponential forms of
the upper bounds are given for comparison. A filing observation, not a
review verdict: the Conclusion (p. 16) names the border between the last
two ranges of (d) as m=343118772/343118773, while the theorem and
Corollary 11 print 527875034/527875035.
Source. John Simons and Benne de Weger, Theoretical and computational
bounds for m-cycles of the 3n+1 problem, version 1.44 (31 August
2010), the authors' updated version of Acta Arith. 117 (2005), no. 1,
51--70, DOI 10.4064/aa117-1-3. Theorem 3 on p. 5, the setting on pp. 1--3,
the proofs of its parts on pp. 11, 13--14 and 16, read on the page images
of version 1.44. The artifact is identified in the
source digest.
Read depth. Claims checked: the statement, its table and the setting
were read clause by clause on the page images; the lemmas and the
assembling proofs were read for structure only; no inequality was rechecked
and no computation was rerun.
Proof pointer
With Λ=(K+L)log2−Klog3, Lemma 4 and Corollary 5 (p. 7) give
0<Λ<m/xmin≤m/X0, and Lemmas 6 and 7 (p. 8) an upper bound
for Λ exponentially small in K; Lemma 12 (pp. 10--11), from
Rhin's bound for linear forms in log2 and log3 together with Lemma 8,
gives Λ>e−13.3(0.46057+logK); comparing the two (Lemma 14,
p. 11) gives K<K1(m), hence part (a) and part (d) for
m≥515620, with the lower bound for K from Corollary 11 (p. 10)
and the bounds for L and xmin from Lemma 8 and Corollary 13. Continued
fractions of δ, computed to a200001, sharpen the upper bound
to K<K2(m) for 64≤m≤515619 (Lemma 16, p. 13), giving part (d)
for 91≤m≤515619 (pp. 13--14). Part (b): m=1 is Steiner's
theorem (p. 2), 2≤m≤68 is Lemmas 15 and 17 (pp. 12, 14), and
69≤m≤75 is the approximation-lattice search of Lemma 18(a)
(p. 15); parts (c) and (d) for 76≤m≤90 come from Lemmas 18(b) and
18(c) with Lemma 8, Corollary 5 and the continued fraction of δ
(p. 16). Not reconstructed here.
Dependencies
The verification bound xmin>X0=5⋅260 (Oliveira e Silva's
computations, the paper's [OS]), on which (b) for 2≤m≤75 (through
Lemma 10 and Corollary 11, p. 10, and Lemma 18), (c) and (d) rest; Rhin's Proposition on p. 160
of Approximants de Padé et mesures effectives d'irrationalité, Progr.
Math. 71 (1987), 155--164 (Lemma 12); Brox, Acta Arith. 92 (2000),
181--188 (credited for (a)); Steiner's theorem on 1-cycles (Proc. 7th
Manitoba Conf. Numer. Math. 1977, the case m=1); Crandall, Math. Comp. 32
(1978), 1281--1292 (Lemma 1 and Corollary 2, the second-to-last line of
Corollary 11). Its consumer here is
Hercher's Theorem 23,
whose proof starts from the lower bound K>7⋅1011 for m≤91 that
Theorem 3 gives and ends against the bound K<1.4784mδm of part
(d).
Bears on
- Problem 1135: for the page's map f, no
nontrivial cycle with at most 75 local minima exists, given the
verification bound 5⋅260 of 2010; cycles with more local minima
and divergent trajectories are left open, and Hercher's Theorem 23
extends the exclusion to m≤91 using part (d).