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 sieve-theory
Search options not deleted
user 37555
4
votes
Shifted primes avoiding a set of divisors
No, $\delta_y$ need not tend to 0. Take a rapidly increasing sequence of integers $y_n$. Then define the set $B$ as $\{p-1|\exists n: y_n\leq p\leq 2y_n\}$. Then we have
\begin{eqnarray*}
\delta_{y_n} …
2
votes
A sieve with two parameters
Such a sieve could only exist under rather special conditions. The easiest case would be $\Omega_p=\{0\}$, $z=\sqrt{x}$. In this case the sifted set consists of all integers of the form $pn\leq x$, wh …
12
votes
0
answers
626
views
Sieve bound for prime $k$-tuples
Let $d_1<d_2<\dots<d_k$ be integers. Then the number of integers $n\leq x$, such that $n+d_1, n+d_2, \ldots, n+d_k$ are simultaneously prime, is bounded above by
$$
\mathfrak{S}(d_1, \ldots, d_k) (Ck) …