Prime numbers to the rescue. This is very interesting
bepis
Huh, the radical inverse seems so arbitrary. Is there a good place to read about how this works?
clam
This is the most disgusting function I've seen in a long time. How would you even go about implementing this to be fast enough to be worth switching to?
Azure
It takes O(log N) time to compute the sequence of base-k digits, and so computing and reversing that shouldn't take that long.
On the other hand, actually computing the first k primes and computing phi_p_k(i) for each k feels like it would take an unordinarily long time; in theory, it could be possible to do it iteratively in about O(NK log N) time...?
Prime numbers to the rescue. This is very interesting
Huh, the radical inverse seems so arbitrary. Is there a good place to read about how this works?
This is the most disgusting function I've seen in a long time. How would you even go about implementing this to be fast enough to be worth switching to?
It takes O(log N) time to compute the sequence of base-k digits, and so computing and reversing that shouldn't take that long.
On the other hand, actually computing the first k primes and computing phi_p_k(i) for each k feels like it would take an unordinarily long time; in theory, it could be possible to do it iteratively in about O(NK log N) time...?