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 prime-gaps
Search options not deleted
user 46140
3
votes
How can I convert Meissel's/Lehmer's formula for prime counting to get sum of primes
If you consult Lehmer's paper, the terms in question arise from $$P_2(x, a) = \sum_{p_a < p_i \le \frac x{p_i}} \sum_{p_i \le p_j \le \frac x{p_i}} 1 = \sum_{p_a < p_i \le b} \left\{ \pi\left(\frac x{ …
- 7,226
4
votes
Accepted
Succinct polynomial sized representation of balanced bipartite graphs whose perfect matching...
Consider the graph $G_k$ with vertex set $$\{u_1, \ldots, u_k, v_1, \ldots, v_k\}$$ and edges $$\{(u_1, v_1), \ldots, (u_1, v_k)\} \cup \{(u_2, v_1), \ldots, (u_k, v_{k-1})\} \cup \{(u_2, v_k), \ldots …
- 7,226