deer unicombas!
b4 2nite's
https://proofwiki.org/wiki/Collatz_Connects_All_Successors_of_Zero
datalosses id like to let ya no dat 85yo collatz conjecture
T⩴{ℤ∍X|(2X↦X)–1↦3X–1)}
∧ C⩴⊆(ℤ⏻T){1}
⇒ C(1+ℕ)
mite b proven by my prime factor walk
C(1+ℕ) ⇔
C((6ℕ±1)(ℕ⏻3)(ℕ⏻2)) ⇔
C((6ℕ±1)(ℕ⏻3)) ⇔
C((6ℕ±1)(ℕ⏻3)(2+1)) ⇔
C((6ℕ±1)) ⇔
C((18ℕ+1±4)) ⇔
C((9ℕ+1±2)) ⇔
C((1+ℕ)(ℕ⏻3)(ℕ⏻2)) ⇔
C(1+ℕ) ⇔
C(1)
inspired by
https://nl.wikipedia.org/wiki/Vermoeden_van_Collatz#Optimaliseringen
(p,q)#>(m,o)|(p,q)<(m,o)=[]
|odd p=[(m+m,o),(m+m,m+o)]
|odd q=(p+p+p+0,q+q+q+1)#>(m,o)
|odd 3=(p`div`2,q`div`2)#>(m,o)
mysterees=iterate((\w->w#>w)=<<)[(1,0)]
bits=unfoldr(listToMaybe.map(swap.flip divMod 2).filter(/=0).(:[]))
i donot wanna b d only 1 sleepin ova dis da cummin nites: yours rumilæ
