@i2cjak Man I just want decent LLM integration in existing tools so they can take over some of the busy work and do some double checking, instead of whatever the hell this is
@DuskyDaily@Temporary111x No, because uint64 overflows. "Collatz holds for all starting numbers < 2^64" and "Collatz holds mod 2^64" are different statements.
A trivial counter example is
(2^64-1)/3 (which is an odd integer). f((2^64 - 1)/3) mod 2^64 = 2^64 mod 2^64=0, which causes infinite recursion.
@Austin_Federa Those would be pretty uninformed socialists then. Taxation back then was mostly just flat duties on trade, which impact people with low income a lot more