SUMMARY:The so-called 3x+1 problem is to prove that all 3x+1
sequences eventually converge. The sequences themselves however and their
lengths display some interesting properties and raise unanswered questions.
These pages supply numerical data and propose some conjectures
on this innocent looking problem.
Note : although the sequence is equally well defined when the process is
applied to negative integers this page deals with
positive integers only, also known as the Natural Numbers.
Therefore all results on this page shall always be understood to refer to
natural numbers only.
We now define
Mx(N) = lim k → ∞ Max(S0,
S1, ..., Sk)
Mn(N) = lim k → ∞ Min(S0,
S1, ..., Sk)
Thus we will call any positive integer
if Mn(N) = 1
if Mx(N) does not exist
No positive integer N is known which may possibly be divergent, and we therefore
reach the widely believed yet still unproven:
Conjecture 1a : (weak 3x+1 conjecture)
No integer N is divergent.
Serious indications exist however that no other cycle but the simple 4-2-1
cycle exists. In fact it is already known that any other cycle must
contain at least a very large number of elements.
See the cycles page to find out the exact numbers
and how they follow from the current status of the problem.
It is therefore not unreasonable to state
Conjecture 1b : (strong 3x+1 conjecture)
All positive integers N are convergent.
This conjecture remains unproven to this day.
While most authors on the subject have concerned themselves mainly with proving
conjecture 1b, on these pages we will from here on assume that conjecture 1b holds
and look into a number of other properties of the 3x+1 sequences.
for any positive integer N > 1 let k be the lowest index for which
Sk < N.
We shall call k the Glide of N and write this as G(N).
Calculating the Glide for any positive integer is tantamount to showing it is
convergent, as long as all smaller numbers are known to be convergent as well.
Thus we may restate conjecture 1b as follows:
It may not be immediately obvious from the definition of the sequence that
arbitrarily high Glides must exist. But observe that any number of the form
N = 2p - 1 with
p > 1 will have
S2 = 3 * 2p-1 - 1 and, since
S2 is odd :
S4 = 3 * 3 * 2p-2 - 1 and eventually
S2p = 3p - 1.
Hence Si will not be below N
for at least 2p steps, and therefore G(N) > 2p.
Although Glides are thus unbounded it is a far different proposition to find
the smallest number for which G(N) > k
for any given k.
a positive integer N is called a Glide Record
if for all M < N we have G(M) < G(N)
Skipping the trivial numbers 1 and 2 the first Glide Records are
N = 3 G(N) = 6
N = 7 G(N) = 11
N = 27 G(N) = 96
N = 703 G(N) = 132
and so on.
The author calculated Glides over a substantial interval,
and the Glide Records found so far are given in the
Glide Records Table.
Delay and Residue
for any positive integer N let k be the lowest index for which
Sk = 1.
We shall call k the Delay of N and write this as D(N).
A positive integer N is called a Delay Record
if for all M < N we have D(M) < D(N).
Lengthy calculations have been made in trying to find Delay Records.
All currently known Delay Records are given in the
Delay Records Table.
Note: to calculate the delay of any number yourself try the 3x + 1 calculator page.
for any positive integer N let E(N) and O(N) denote the number of
elements from S0 to SD(N)-1 which are even or odd,
respectively. Obviously O(N) + E(N) = D(N).
Now due to the construction of the sequence we may write
2E(N) = 3O(N) * N * Res(N)
where Res(N) is a factor equal to the product of (1 + 1 / ( 3 * Si ) )
taken over the odd elements Si for 0 ≤ i < D(N).
We will call Res(N) the Residue of N.
It turns out that Res(N) is usually small and typically lies
between 1.10 and 1.25. Therefore it appears reasonable to propose
Conjecture 2a : (weak residue conjecture)
A number Resmax exists such that for every positive integer
Res(N) < Resmax.
There are serious indications though that a much more explicit
conjecture can be made:
Conjecture 2b : (strong residue conjecture)
For all N : Res(N) ≤ Res(993).
For the evidence to support this conjecture look at the
Whether conjecture 2b is true or not, we will from now on assume that at
least conjecture 2a holds, and also that Resmax << 6.
for all integers N > 1 the Completeness
of N, C(N), is defined by C(N) = O(N) / E(N).
Theorem 1 :
For all N > 1: C(N) < ln(2)/ln(3) = 0.63092975...
From the previous paragraph we had, by definition
2E(N) = 3O(N) * N * Res(N) Taking the logarithm and regrouping yields
O(N) / E(N) = ln(2) / ln(3) - (ln(N) + ln(Res(N))) / (E(N).ln(3) ) The final term is often small, but always > 0.
This leads to the rather more complex question of how close C(N) can
get to its theoretical limit. If the final term could get infinitesimally close to
zero then the completeness would get infinitesimally close to this limit.
For large N the final term is proportional to ln(N) / E(N).
The reciprocal of this quantity is usually defined as Gamma.
for all integers N > 1 Gamma(N)
is defined by E(N) / ln(N).
There is ample evidence to suggest that Gamma(N) will not reach
arbitrary large values, and so we reach
Conjecture 3 :
A number Cmax exists such that
for all N > 1 : C(N) < Cmax.
with Cmax < ln(2) / ln(3).
Or, in simpler terms: C(N) will not get infinitesimally
close to its theoretical limit. For the evidence to support this
conjecture look at the completeness page.
A number N > 1 is called a Completeness Record
if for all M < N we have C(M) < C(N).
Similarly we have
A number N > 1 is called a Gamma Record
if for all M < N we have Gamma(M) < Gamma(N).
From the similarity of their definitions it should come as no surprise that
the tables of known Completeness and Gamma records are virtually the same.
Assuming Conjecture 1b holds we can partition the positive integers into
Delay Classes DCk (k=0,1,2,3...) where an integer N is said
to belong to class D(N).
We note that no class is empty as for N = 2k
we have D(N) = k.
The lowest element of a Delay Class DCk
is called its Class Record, indicated by Rk.
Class Records of consecutive classes are often 'related',
the lower one occurring in the sequence of the higher one.
Assuming Conjecture 2a holds, with Resmax < 6 we have:
Theorem 2 :
Let Rk and Rk+1 be the records of
Delay Classes k and k + 1, respectively.
Then O(Rk) <= O(Rk+1)
and E(Rk) <= E(Rk+1).
Let Rk and Rk+1
be the records of classes k and k+1 respectively.
Assume O(Rk) - O(Rk+1) = x,
x > 0.
Then Rk+1 / Rk is equal to
2x+1 * 3x *
Res(Rk) / Res(Rk+1)
which for positive x is definitely >> 2.
Since N = 2 * Rk has a delay of
k + 1 and is smaller than Rk+1,
this would imply that Rk+1 would be no class record.
Therefore O(Rk) <= O(Rk+1).
Assume that E(Rk) - E(Rk+1) = x,
x > 0.
Then Rk / Rk+1
is equal to 2x * 3x+1 *
Res(Rk+1) / Res(Rk)
which for positive x is definitely >> 3.
Since either N = 3 * Rk+1 + 1 or
N = Rk+1 / 2 has delay k,
and both are smaller than Rk this would imply
that Rk would be no class record.
Therefore E(Rk) <= E(Rk+1).
From the above result we may easily derive
Theorem 3 :
Let N be any Completeness Record.
Then N is a Class Record as well.
Assume a number M < N exists with D(M) = D(N).
• If O(M) = O(N), and thus E(M) = E(N),
then C(M) = C(N) and thus N would be no Completeness Record.
• If O(M) > O(N) then C(M) > C(N) and again
N would be no Completeness Record.
• Finally if O(M) < O(N) then, still assuming
conjecture 2a holds, M would not be < N.
Therefore such an M does not exist and N is therefore a Class Record.
Theoretically a Completeness Record does not necessarily have to be a
Delay Record as well, since a lower number with a higher Delay but
lower Completeness might exist. All currently known
Completeness Records are Delay Records as well though.
As of December 2020 all class Records up to 2191 are known.
If Conjecture 2a holds, with Rmax << 6, this also implies that
the elements of a Delay Class occur at discrete levels,
which roughly lie a factor 6 apart.
The elements of class 13 for example are 34, 35, 192, 208, 212, 213, 226,
227, 1280, 1344, 1360, 1364, 1365 and 8192. The grouping into four
different "subclasses" is obvious.
In order to work with levels we first define a more basic parameter called the Strength:
For all positive integers N with D(N) = k
the Strength S(N) is defined by
S(N) = 5 * O(N) - 3 * E(N).
The Strength of most numbers is well below zero, and positive Strengths are quite rare.
It would appear though that arbitrarily high Strengths should exist.
A positive integer N is called a Strength Record
if for all M < N we have S(M) < S(N).
Strength records are quite rare. Only five non-trivial records are known, and the highest one
of those has 18 digits already. They can be found on the Strength page
together with a few numbers that are currently the best known candidates for the next records.
Based on the Strength it is easy to define the Level. Note that for all numbers
N with D(N) = k we have necessarily S(N) ≡ 5k (mod 8)
For all positive integers N with D(N) = k
the Level L(N) is defined by
L(N) = - [S(N) / 8 ]
(where [x] is meant to be the largest integer ≤ x)
Thus S(34) = 5 * 3 - 3 * 10 = -15. Therefore L(34) = -[-15/8] = 2.
Similarly L(192) = 3, L(1280) = 4 and L(8192) = 5.
For any delay k the highest possible level occurs at N = 2k, as
this is the highest number with this delay.
Level 0 can be seen as the highest level for which C(N) >= 0.60.
With lower numbers the 'limited availability' of numbers makes statistics a risky approach, but
with higher numbers we may say that the level yields information about the relative 'exclusiveness'
of the record. From a statistical point of view with levels 'close to 0' we find that the lower the
level, the less numbers are found at that level. Although numbers with negative levels do exist they
are quite rare. The only number below 10,000,000,000 for which L(N) < 0
occurs at N = 63,728,127, for which L(N) = -1.
The next ones are L(12,235,060,455) = -1 (D(N) = 1184) and L(13,371,194,527) = -1
(D(N) = 1210). Up to 21,000,000,000 three more level -1 numbers exist, but then
surprisingly the next one does not appear until R1408 = 1,444,338,092,271,
a number almost 70 times larger than its predecessor. Only 9 numbers of level -1 exist before the
first number of level -2 occurs: R1549 = 3,743,559,068,799. This number shows
a surprisingly high delay, surpassing the previous Delay Record by no less than over one hundred.
Up to 100,000,000,000,000 (1014) one finds approximately 100 numbers of
level -1 and just a single one of level -2, which gives a fair indication of their rarity.
Thus it is rather unexpected the first number of level -3 is found just outside this interval
at N = 100,759,293,214,567. With a Delay of 1820 this number is
not only a Delay Record, surpassing the previous record with no fewer than 158 steps, but a Strength
and Completeness Record as well. Remarkably a further level -3 number pops up almost immediately as
R1789 is found at N = 104,797,092,792,063.
A total of 15 level -3 numbers exist between 100 * 1012 and 531 * 1012
but no others appear quickly thereafter. In fact no further level -3 numbers exist below 1016.
The next one is N = 12769,884180,266527, over 20 times larger than
the previous one.
Still lower levels are ever harder to come by. As the numbers increase searches become slower and search
intervals get wider. The lowest level -4 number, now confirmed as a Delay and Strength record, has 18
digits. The smallest number of level -5 found so far has 21 digits and the lowest number currently
known of level -10 has no less than 36 digits. Reactions from anybody who might have found stronger
candidates are very welcome!
Path records and Expansion
Any positive integer N can be completely defined by the delay, the level and the residue, i.e. from these
three data N can be calculated exactly. Neither of these however give any information about the path of the
sequence Si. In particular no information is available of Mx(N), the highest number occurring in
the 3x+1-sequence. This number is of practical importance as well, since it indicates the minimum number
of bits needed for a computer algorithm to calculate a particular sequence without overflows occurring.
Note: to calculate the maximum of any number yourself try the 3x + 1 calculator page.
a positive integer N is called a Path Record
if for all M < N we have Mx(M) < Mx(N)
The first Path Records are
N = 2 Mx(N) = 2
N = 3 Mx(N) = 16
N = 7 Mx(N) = 52
N = 15 Mx(N) = 160
N = 27 Mx(N) = 9232
and so on. Path records can be conveniently numbered in the order in
which they occur. Thus P1 = 2, P2 = 3, etc.
A curious observation about the values of Mx(N) is
Theorem 4 :
Let N be any odd number > 2. If Mx(N) > 3N + 1
then Mx(N) ≡ 16 (mod 36).
Let x be Mx(N), where x ≡ a (mod 36).
We note that a can not be odd, since x must be even. We also note that
we can not have a ≡ 2 (mod 4) or else x/2 would be odd which would
yield a higher number than x. Therefore a ≡ 0 (mod 4).
Since x must be produced by a 3n+1 iteration we have a ≡ 1 (mod 3).
This leaves just 4, 16 and 28 as possible values for a.
Assume a = 4. Then let x = 36n+4. The predecessor of x must have been
12n+1. Then its predecessor was 24n+2. Since this number is
not ≡ 4 (mod 6) it must have had 48n+4 as its predecessor.
But this number is greater than x, which contradicts the assumption that x is Mx(N).
Similarly for a = 28 we find predecessors 12n+9, 24n+18 and 48n+36,
which again contradicts the assumption that x is Mx(N).
Therefore we can only have a = 16, and therefore Mx(N) ≡ 16 (mod 36)
(and its predecessors in the sequence are 12n+5, 24n+10 and 8n+3).
For all Path Records Pi ≥ 3 we indeed have Mx(Pi ) > 3.Pi + 1,
therefore for i ≥ 2 all Mx(Pi ) ≡ 16 (mod 36).
The Expansion with respect to Q, XQ of N is defined as
XQ(N) = Mx(N) / NQ
It is easily seen that X1(N) is unbounded, since if
N = 2p - 1 then, as we saw earlier,
S2p = 3p - 1
and Mx(N) / N is at least approximately equal to
3p / 2p.
A more interesting question arises when we ask for which p Xp
might stay bounded. The following result is well known:
Theorem 5 :
XQ is unbounded for Q < ln(3) / ln(2)
We saw earlier that for N = 2p - 1Mx(N) will be at least 3p - 1.
Thus for p towards infinity
ln(XQ( N )) = ln( Mx(N) ) - Q * ln( N ) >= p * ( ln(3) - Q * ln(2) )
So for Q < ln(3) / ln(2) the limit does not exist.
When 2log( Mx(Pi )) is depicted graphically against
2log( Pi ) the curve
shows a tendency to become linear with an approximate slope of 2.
It is not currently known whether or not this tendency is likely to persist.
If it does it implies that XQ(N) is bounded for Q > 2.
Open Question 1 :
Does a number C exist for which X2(N) < C
for all N ?
And if it does, what is the value of C ?
For many years the highest X2(N) known was that of P62
(~ 15.054) and it looked unlikely a higher one would be found in the near future.
In 2005 however Tomás Oliveira e Silva
found P88 which has an expansion of ~ 16.315.
As can be seen from the Path Records Table record expansions
are very rare. The function X2(N) reaches a temporary maximum of
12.66 at N = 27, which holds until P43 = 319,804,831
is reached, a number over 10,000,000 times larger.
Again, the value of 13.83 reached by P43
is not surpassed until P62, which scores 15.05.
P62 is over 10,000 times larger than P43.
Finally the highest expansion currently known is that of P88 which
reaches 16.32. P88 is well over 500,000 times larger than
If successive gaps between ever higher values of the function
X2(N) continue to be of this magnitude it looks unlikely
we will ever know more than a handful of Expansion Records.
All numbers up to 268 ( ~ 2.95 * 1020 ) have been checked once for convergence.
All numbers up to 87 * 260 ( ~ 1.00 * 1020 ) have been double checked for convergence.
All numbers up to 5 * 260 ( ~ 5.76 * 1018 ) have been at least triple checked for convergence.
All numbers up to 260 ( ~ 1.15 * 1018 ) have been checked in at least four projects for convergence.
All numbers up to 10.82 * 1017
have been checked for class records. ( View progress )
Whenever (computer) time is available the quest for new records still continues!
The program currently focuses on using GPU cards for maximal progress.
The program runs totally unattended, so anyone with a GPU can
join the 3x+1 search! Just look at the 3x+1 search page to see
how to join, or take a look at the Class record progress map.
Special thanks to Kevin Hebb from Canada for the time and effort he took for many
years to make dozens of PC's work day and night on the problem and to Fang Wenjie for
creating the recent GPU version of the program.
Please mail any offers for additional help to
of these pages.