A New Approach on Proving Collatz Conjecture
Collatz Conjecture (3x+1 problem) states any natural number x will return to 1 after 3⁎x+1 computation (when x is odd) and x/2 computation (when x is even). In this paper, we propose a new approach for possibly proving Collatz Conjecture (CC). We propose Reduced Collatz Conjecture (RCC)—any natural...
Saved in:
| Main Author: | Wei Ren |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2019/6129836 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Novel Theorems and Algorithms Relating to the Collatz Conjecture
by: Michael R. Schwob, et al.
Published: (2021-01-01) -
Furstenberg Topology and Collatz Problem
by: Edward Tutaj, et al.
Published: (2025-04-01) -
Proving the Weak Gravity Conjecture in perturbative string theory. Part I. The bosonic string
by: Ben Heidenreich, et al.
Published: (2025-05-01) -
Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach
by: Eyob Solomon Getachew, et al.
Published: (2025-01-01) -
A new proof of the GGR conjecture
by: Ash, J. Marshall, et al.
Published: (2023-01-01)