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 big-picture
Search options not deleted
user 171820
Questions designed to get an overview of a specific subject or body of results or to understand the relations among similar definitions, techniques or concepts appearing in different sub-fields of mathematics. While such questions by their very nature sometimes cannot be made very narrow and focused, it can be helpful to keep in mind that the design of MathOverflow does not make it a good fit for questions that are too broad.
11
votes
Accepted
Can $N!$ be computed in less than $\mathcal{O}(N)$ operations?
The thing that you are asking is the required number of integer operations for computing $N!$ starting only from $1$ and $N$, which is usually referred to as the straight-line complexity of $N!$ denot …
- 561