QB64.org Forum
Active Forums => QB64 Discussion => Topic started by: STxAxTIC on August 17, 2020, 03:26:59 am
-
Continuing the discussion from https://www.qb64.org/forum/index.php?topic=2789.0 (https://www.qb64.org/forum/index.php?topic=2789.0)
... In my time away, I noticed you guys were hitting this topic. Crazy enough, I had only just heard about this problem several days before then. In my usual "never read anyone else's work" fashion, I bring you my thoughts on the topic. It's not a formal proof that would satisfy Paul Erdos, but honestly - I like my results a lot better than the other attempted proofs you see out there. Only one tiny, completely nonessential dabble of calculus here. The rest is all freshly invented so there are no excuses to not get to the end. XD
http://wfbarnes.net/homedata/Collatz%20Conjecture.pdf (http://wfbarnes.net/homedata/Collatz%20Conjecture.pdf)
-
@STxAxTIC
I find your pdf very illuminating... more than other pages that of the table of sequence generated using the Collatz algorythm.
If we see the positive integer family as the set of number going from 1 to +infinite or in different words we see them like an halfline
and if the division is a movement towards the 1 and the multiplication is a movement towars the +infinite, then we can see the Collatz conjecture as this affirmation: starting form any point of the half line we always arrive at point 1 if we divide by 2 the even numbers (if we go towards 1 of half of number's distance from 1) and if we multiply by 3 and we add one (if we go towars + infinite of 3 times the number's distance from 1 and we add 1 unit) getting an even number if the number is odd
here a graphic rapresentation on the table taken from your PDF [ This attachment cannot be displayed inline in 'Print Page' view ]