The logical solution Syracuse conjecture

Rolando Zucchini, Mnamon Editore

• Publisher: Mnamon Editore
• Year: 2022
• Print ISBN: 9788869495892
• eBook ISBN: 9788869495885
• Topic: Mathematics
• Subtopic: Number Theory
• Index: Mathematics

The conjecture of Syracuse, better known as the Collatz conjecture, in this paper is approached from a completely different point of view than many previous attempts, by highlighting some of its features. One of them suggests a process that leads to Theorem 2n+1 whose proof solves the conjecture in a complete and definitive way. Theorem 2n+1 subdivided the set of odd numbers in seven subsets which have different behaviors applying algorithm of Collatz, and allow us to replace the Collatz cycles with the cycles of links, transforming their oscillating sequences in monotone decreasing sequences, which, after a finite number of steps (very low), falls down to 1 always respecting the final cycles {10; 5; 4; 2; 1} or {7; 5; 4; 2; 1}. Binomial inequalities listed in General Summary N(s) ? 21 cover circa 96% of N. By Theorem of Independence we can organize the cycles of links as we like, also for to reach very high main horizons ?(m) and when we decide go back to the lower horizon ?(l)