Collatz Sequence Proof (2nd Way)

01 November 2024, Version 5
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

Abstract of Collatz Sequence Solution (2nd Way) I discovered a fact in Collatz Sequence: S (n) = {a, b, c,…,w} ⇒ LS(n) = LS(a) = LS(b) = LS(c) = …. = LS (w) … (Fact1) n, a, b, c, w, r ∈ N_+, LS(n) = {4,2,1} when n ∈ {1,2,3,4,5, …, r-1} Let LS(r) = {4,2,1} when n ∈ Z = {1,2,3,4,5, …, r-1, r} Part a) If (r+1) ∈ (N_even), and I proved LS(r+1) = {4,2,1} ⇒ LS(n) = {4,2,1} for all even #s Part b) If (r+1) ∈ (N_odd), and I proved LS(r+1) = {4,2,1} by part a. Therefore LS(N) = {4,2,1} for all n ∈N.

Keywords

Collatz
2nd Way Collatz
Unsolved Math
Taha
Number Theory

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.