Convergence of Generalized Collatz Problem in k-Adic Field

In this article, we define a new series transformation called transformation and probe into its fixed point and periodicity. We extend the number field of the transform period problem to a wider field. Different constraints are imposed on then different periodic columns are formed after finite transformations. We obtain that their periodic sequences are and respectively after derivation. As an application, it can provide a reference for C problems in more complex algebraic systems.

Brief Solutions to Collatz Problem, Goldbach Conjecture and Twin Primes

I published some solutions a time ago to Goldbach Conjecture, Collatz Problem and Twin Primes; but I noticed that there were some serious logic voids to explain the problems. After that I made some corrections in my another article; but still there were some mistakes. Even so, I can say it easily that here I brought exact solutions for them out by new methods back to the drawing board.

The Collatz Problem in the Light of an Infinite Free Semigroup

The Collatz (or 3m+1) problem is examined in terms of a free semigroup on which suitable diophantine and rational functions are defined. The elements of the semigroup, called T-words, comprise the information about the Collatz operations which relate an odd start number to an odd end number, the group operation being the concatenation of T-words. This view puts the concept of encoding vectors, first introduced in 1976 by Terras, in the proper mathematical context. A method is described which allows to determine a one-parameter family of start numbers compatible with any given T-word. The result brings to light an intimate relationship between the Collatz 3m+1 problem and the 3m-1 problem. Also, criteria for the rise or fall of a Collatz sequence are derived and the important notion of anomalous T-words is established. Furthermore, the concept of T-words is used to elucidate the question what kind of cycles—trivial, nontrivial, rational—can be found in the Collatz 3m+1 problem and also in the 3m-1 problem. Furthermore, the notion of the length of a Collatz sequence is discussed and applied to average sequences. Finally, a number of conjectures are proposed.

An Artificial Life View of the Collatz Problem

This letter presents a new, artificial-life-based view of the Collatz problem, a well-known mathematical problem about the behavior of a series of positive integers generated by a simple arithmetical rule. The Collatz conjecture asserts that this series always falls into a 4 → 2 → 1 cycle regardless of its initial values. No formal proof has been given yet. In this letter, the behavior of the series is considered an ecological process of artificial organisms (1s in bit strings). The Collatz conjecture is then reinterpreted as the competition between population growth and extinction. This new interpretation has made it possible to analytically calculate the growth and extinction speeds of bit strings. The results indicate that the extinction is always faster than the growth, providing an ecological explanation for the conjecture. Future research directions are also suggested.