The 3x + 1 problem as a string rewriting system

Abstract

The 3 x + 1 problem can be viewed, starting with the binary form for any n N, as a string of runs of 1s and 0s, using methodology introduced by Baewicz and Pettorossi in 1983. A simple system of two unary operators rewrites the length of each run, so that each new string represents the next odd integer on the 3 x + 1 path. This approach enables the conjecture to be recast as two assertions. (I) Every odd n N lies on a distinct 3 x + 1 trajectory between two Mersenne numbers (2 k - 1) or their equivalents, in the sense that every integer of the form (4 m + 1) with m being odd is equivalent to m because both yield the same successor. (II) If T r (2 k - 1) → (2 l - 1) for any r, k, l > 0, l < k; that is, the 3 x + 1 function expressed as a map of k 's is monotonically decreasing, thereby ensuring that the function terminates for every integer. Copyright 2010 Joseph Sinyor.