论文标题
Collatz猜想的证明
A Proof for the Collatz Conjecture
论文作者
论文摘要
众所周知，以下Collatz猜想是数学中未解决的问题之一。 Collatz猜想：对于任何正整数$ n> 1 $，以下递归算法将通过有限数量的步骤收敛至1。 a）如果$ n $是一个偶数号码，则$ n/2 \ to n $，b）如果$ n $是一个奇数，则$ 3n+1 \ to n $。本文通过基本数学诱导提出了Collatz猜想的证明。
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps. A) If $n$ is an even number then $n/2 \to n$, B) If $n$ is an odd number then $3n+1 \to n$. This paper proposes a proof for the Collatz Conjecture by the elementary mathematical induction.
