Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with digits
Search options answers only
not deleted
user 18060
18
votes
Accepted
Can we compute the first $n$ digits of $\pi$ in $F(n)$ time?
It follows that if one can compute $2^{ 42n} \pi$ to within an error of at most $1$, one can compute the first $n$ digits of $\pi$, since the only way the knowledge of $2^{42n}\pi$ to within an error of … So running an algorithm "assuming there are no long carries" to compute the first $42n$ digits will suffice unconditionally to compute the first $n$ digits.
(1): K. Mahler. On the approximation of π. …
- 148k