For example, a = 3, b = 2 gives the 3x+1 mapping:
Caveney was not aware that his mapping was a special case of a mapping studied by Herbert Möller in 1978, which in turn was generalized in 1984 to the case of a relatively prime mapping by K.R. Matthews and A.M. Watts. Caveney's mapping can also be written as a b-branched mapping:
This reduces to W. Carnielli's mapping if a = b+1, as ri = b - i if 1 ≤ i < b.
According to Möller, it seems certain that for x ∈ ℤ, the sequence of iterates x, T(x), T2(x), ... always eventually enters a cycle if a < bb/(b-1) and that regardless of this inequality, there are only finitely many such cycles. Also if a > bb/(b-1), the prediction is that most trajectories will be divergent.
We note that writing a=b+x, x ≥ 1, we have log(1+x/b) < x/b, (1+x/b)b < ex, so if x + b > ex, we have (1+x/b)b < b+x and hence (b+x)b-1 < bb.
Hence a < bb/(b-1) if b > ea-b -(a-b). In particular, we have the following inequalities:
all iterates will eventually enter one of the following cycles:
all iterates will eventually enter one of the following cycles:
Last modified 22nd August 2011
Return to main page