7x±1: Close Relative of Collatz Problem

2018/07/02 by David Barina, Barina, David
Computer Science · Mathematics · #11B37 #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1807.00908

openalex publication_date 2018/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by a heuristic argument and computational results.

Related

• A dynamical approach towards Collatz conjecture
• Novel Theorems and Algorithms Relating to the Collatz Conjecture
• The Collatz Problem generalized to 3x+k
• Determining monotonic step-equal sequences of any limited length in the Collatz problem
• Generalized Collatz Maps with Almost Bounded Orbits