Free Republic

I don’t have a mathematics background, but have done well in math generally, understand some of the concepts. I’ve been interested in this problem since seeing a YouTube video from the science channel Veritasium on the subject. After going over it for a time, I noticed some patterns in the numbers that are most divisible by 2. Here’s a summary of what I found, and I wonder how it fits into the picture. 1. Starting from 0: 3(0)+1=1. 2. Next, starting from 1: 3(1)+1=4. That’s the initial “4>2>1.” 3. Then, substitute 2: 3(2)+1=7. And 3: 3(3)+1=10. And 4: 3(4)+1=13. 4....

It is one the oldest mathematical problems in the world. Several centuries ago, the twin primes conjecture was formulated. As its name indicates, this hypothesis, which many science historians have attributed to the Greek mathematician Euclid, deals with prime numbers, those divisible only by themselves and by one (2, 3, 5, 7, 11, etc.). Under this assumption, there exists an infinite number of pairs of prime numbers whose difference is two, called twin primes (e.g., 3 and 5), but nobody has been able to confirm this so far.

So I did a proof of the Collatz Conjecture, and am wondering if anybody here familiar with the process of getting it published. This place has a lot of experts, and if the proof holds, it would be news in itself. Proof is here: https://easyupload.io/8yx8a4