2021/05/29 by Raouf Rajab, Rajab, Raouf
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #General Mathematics (math.GM) #Primary 11B83 secondary 11B50 #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.2106.01324
openalex publication_date 2021/05/29 · openalex created_date 2021/06/22 · openalex updated_date 2026/07/28
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of positive integers such that the term of rank n is results of applying Collatz map n times to the first term. Such term can be expressed on the form Tn(P)=A(P,n)P+B(P,n). When n tends to infinity, each function among the two partial coefficients denoted by A(P,n) and B(P,n) behaves in different ways. This allows us to determine all categories of Collatz infinite sequences. First, we carry out a classification of Collatz infinite sequences on based of the different possible limits of the two coefficients. In second time, we determine the different proportions of every class of the infinite sequences. Note that results obtained do not represent a proof of a Collatz conjecture but they have a strong relationship with this conjecture and it allows us to better understand the behavior of Collatz sequences when n tend to infinity.