2 ms·
Faster than what? Are you factoring in the time to build the lookup table for primes greater than a google?
by cipehr 1y ago
Faster than what? Are you factoring in the time to build the lookup table for primes greater than a google?
- charcircuit 1y agoFaster than exp(((64/9)^1/3 + o(1))*((log n)^1/3 (log log n)^2/3)). The time building the table is not counted as that happens ahead of time.
- nine_k 1y agoThe idea is to do it once. A lot can likely be compressed, while keeping access time log-linear. Store it passively, so that it won't need power except for reading, like mask ROM or CD-ROM do not.