English

Integer Representations and Trajectories of the 3x+1 Problem

History and Overview 2020-05-19 v2 Combinatorics Number Theory

Abstract

This paper studies certain trajectories of the Collatz function. I show that if for each odd number nn, n3n+2n\sim 3n+2 then every positive integer nN2Nn \in \mathbb{N}\setminus 2^{\mathbb{N}} has the representation n=(2ak+1i=0k2ai3ki)/3k+1n=\left(2^{a_{k+1}}-\sum_{i=0}^{k}{2^{a_i}3^{k-i}}\right)/ 3^{k+1} where 0a0a1ak+10\le a_0 \le a_1 \le \cdot \cdot \cdot \le a_{k+1}. As a consequence, in order to prove Collatz Conjecture I illustrate that it is sufficient to prove n3n+2n\sim 3n+2 for any odd nN2Nn\in \mathbb{N}\setminus 2^{\mathbb{N}} . This is the main result of the paper.

Keywords

Cite

@article{arxiv.1906.10566,
  title  = {Integer Representations and Trajectories of the 3x+1 Problem},
  author = {Roy Burson},
  journal= {arXiv preprint arXiv:1906.10566},
  year   = {2020}
}
R2 v1 2026-06-23T10:03:10.184Z