Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
matvore
on Nov 11, 2023
|
parent
|
context
|
favorite
| on:
Computation of the n'th digit of pi in any base in...
If you store the number of zeros as value z, computing z+1 is O(log n) in the long run for unbounded values of z.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: