I'm trumping your claim.
If La0 is a positive integer and we define the map T on positive integers. n is multiplicatively "odd" ,n has an odd exponent of 2 in its prime factorization, set T(n). existing arbitrarily large n whose next iterate increases by at least a factor of 3 (take n with v2(n) odd), so no finite interval can be a global attractor; the system is non-attracting (repelling) in that sense.
What is LoA? There's o_n and e_n which are odd factors in the sequence and (small sigma)(a_n) that is the binary state its members of a_n... And f(a_n) and also (a_n') ... I just showed this to say I'm not just screwing this on paper this is actually real trust me... Later tonight ill post more after i, done tweaking page 1... Remember i already hav313 page proo with graphs ad dtanpublisred... and... REMEMBER I HAVE NO EDUCATION, SO ITS NOT PROPER YET.
This post was edited by Costello on Apr 9 2026 05:39pm