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 reference-request
Search options not deleted
user 94470
This tag is used if a reference is needed in a paper or textbook on a specific result.
1
vote
Higher dimensional analogs of logarithmic density
The natural $k$-dimensional analogue of logarithmic density is
$$
\lim_{x \rightarrow \infty} \frac{1}{(\log x)^{k}} \sum_{\substack{n_1, \ldots, n_k \leq x \\ (n_1, \ldots, n_k) \in S}} \prod_{i = 1} …
- 104
47
votes
Examples of algorithms requiring deep mathematics to prove correctness
The Miller-Rabin tests determines whether an integer $n$ is prime in time $O_{\epsilon}((\log n)^{4+\epsilon})$. The bound on the running time is conditional on the truth of the Generalized Riemann Hy …