▲ 1 r/Collatz
Quickest way to find the sum of Collatz steps from 1 to N in C
If f(n) is the amount of Collatz steps it takes for n to reach 1, what is the quickest way (in terms of run time) to find f(1)+f(2)+...+f(n), where n can go as high as 10^9?
u/Hour_Extent_3807 — 3 days ago