In solving the Collatz conjecture, it turns out that if we let all integers k be 6n, 6n+1, 6n+2, 6n+3, 6n+4, 6n+5, then we can solve the Collatz conjecture periodically. The Collatz conjecture states that for any positive integer P (initial value), if n is even, divide n by 2; if n is odd, repeat the rule of multiplying n by 3 and adding 1, which always converges to 1. One open problem has been proved by this paper. The authors hope to contribute to the mathematical community by presenting simple proofs of conjectures in the history of mathematics such as the Collatz conjecture.
No takes yet. Share an insight, caveat, or question.
Shiraishi et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: