English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

I show here that there are three different kinds of iterations for thereduced Collatz algorithm; depending on whether the root of the number is oddor even. There is only one kind of iteration if the root is odd and two kindsif the root is even. I also show that iterations on numbers with odd roots willcause an increase in value and eventually lead to an even rooted number. Theiterations on even rooted numbers will subsequently cause a decrease in values.Because increase in values during the odd root iterations are bounded, Iconclude that the Collatz iteration cannot veer to infinity. Since the sequencegenerated by the Collatz iteration is infinite and the values of the numbers donot veer to infinity it must either cycle and/or converge. I postulate that anycycling must occur with alternating types of iterations: e.g. odd rootediterations which cause the values of the numbers to increase followed by evenrooted iterations which causes the values to decrease. I show here that forsimpler types of cycles, valid values of odd rooted or even rooted numbers areonly found in a narrow gap which closes as the number of iterations increase. Ifurther generalize to all types of odd-even and even-odd iterations. Given thatprevious work has shown that only very large non-trivial cycles are feasibleduring the Collatz iteration and this study shows the low probability of largesimple cycles, leads us to the conclusion most likely cycles other than thetrivial cycle are not possible during the Collatz iteration.

Predictable trajectories of the reduced Collatz iteration and a possible pathway to the proof of the Collatz conjecture (Version 2)