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 questions only
not deleted
user 955
24
votes
0
answers
1k
views
0's in 815915283247897734345611269596115894272000000000
Is 40 the largest number for which all the 0 digits in the decimal form of $n!$ come at the end?
Motivation: My son considered learning all digits of 40! for my birthday. …
- 18.9k
13
votes
1
answer
577
views
Can we compute the first $n$ digits of $\pi$ in $F(n)$ time?
I've seen various fast algorithms for computing the first few, or directly the $n$-th, digits of $\pi$. … So my question is:
What is the best known $F(n)$ for which the first $n$ digits of $\pi$ can be computed in $F(n)$ steps? …
- 18.9k