arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.07312math.GM
收藏

关于Collatz猜想

On Collatz Conjecture

Erhan Tezcan

摘要:

Collatz猜想可以表述为:使用约化Collatz函数$C(n) = (3n+1)/2^x$,其中$2^x$是2的最大乘方,其整除$3n+1$,任何奇数$n$最终将在$j$迭代中达到1,使得$C^j(n) = 1$。本文使用既约Collatz函数和逆既约Collatz函数。我们提出奇数作为分数的总和,我们称之为“分数和记法”及其推广形式“中间分数和记法”,我们用它来提出一个公式,以获得更大的Collatz序列长度的数字。我们给出了一个公式来获得序列长度为2的数。我们证明了如果$n$的轨迹是循环的,并且存在奇数个$m$使得$C^j(m) = 1$,$n$必须是形式$3^j\times2k + 1, k \in \mathbb{N}_0$,其中$C^j(n) = n$。我们使用中间分数和符号来证明一个简单的证明,即除了平凡循环两次之外,没有长度为2的循环。然后,我们与反向约化Collatz函数,并提出了一个修改后的版本,它使我们能够确定模6的结果。我们提出了一个程序来生成一个Collatz图使用反向约化Collatz函数。

英文摘要:

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$. In this paper we use reduced Collatz function and reverse reduced Collatz function. We present odd numbers as sum of fractions, which we call `fractional sum notation' and its generalized form `intermediate fractional sum notation', which we use to present a formula to obtain numbers with greater Collatz sequence lengths. We give a formula to obtain numbers with sequence length 2. We show that if trajectory of $n$ is looping and there is an odd number $m$ such that $C^j(m) = 1$, $n$ must be in form $3^j\times2k + 1, k \in \mathbb{N}_0$ where $C^j(n) = n$. We use Intermediate fractional sum notation to show a simpler proof that there are no loops with length 2 other than trivial cycle looping twice. We then work with reverse reduced Collatz function, and present a modified version of it which enables us to determine the result in modulo 6. We present a procedure to generate a Collatz graph using reverse reduced Collatz functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑