List questions from sieve-theory

Published on 20 Jan 2019 - 22:29

303

Views

Number of integers coprime to a given integer $q$ in some range $[x, x+y]$

Published on 23 Feb 2026 - 2:58

50

Views

Is or can Brun's twin prime theorem be generalized to a sum over all primes differing by less than a fixed gap?

Published on 08 Mar 2019 - 4:07

257

Views

In the rational Sieve method why does n = gcd(a-b,n)×gcd(a+b,n) exactly?

Published on 11 Mar 2019 - 3:21

319

Views

Find minimum GCD of a pair of elements in an array

Published on 14 Apr 2019 - 8:14

257

Views

Maynard-Tao vs GPY sieve weights for bounded gaps between primes

Published on 01 May 2019 - 21:36

44

Views

Does this behavior of simple sieves have a name?

Published on 03 May 2019 - 2:04

210

Views

RSA - Quadratic Sieve - Relation Building - How to choose $b$ in $F(b)$?

Published on 05 May 2019 - 23:16

341

Views

Are there infinitely many primes that are 1 more a square-free number?

Published on 07 Jun 2019 - 22:23

294

Views

A horrendous sieve with potentially terrific consequences

Published on 17 Jun 2019 - 19:05

155

Views

What is the upper bound for $\prod_{p|N}(1+p^{-1})$?

Published on 29 Jun 2019 - 3:01

813

Views

Small gaps between primes Maynard-Tao sieve why it works

Published on 23 Feb 2026 - 4:53

72

Views

Is there a name or theory for this sieve characteristic?

Published on 19 Sep 2019 - 18:12

1.4k

Views

What are some good introductory textbooks on Sieve Theory?

Published on 17 Apr 2014 - 22:50

83

Views

For all prime $\ p > \ 2,\ p=2^x \cdot Ord_p(2)+1$?

Published on 26 May 2014 - 12:50

List Question

Has such a variant of the Möbius function been used in sieve methods?

Number of integers coprime to a given integer $q$ in some range $[x, x+y]$

Is or can Brun's twin prime theorem be generalized to a sum over all primes differing by less than a fixed gap?

In the rational Sieve method why does n = gcd(a-b,n)×gcd(a+b,n) exactly?

Find minimum GCD of a pair of elements in an array

Maynard-Tao vs GPY sieve weights for bounded gaps between primes

Does this behavior of simple sieves have a name?

RSA - Quadratic Sieve - Relation Building - How to choose $b$ in $F(b)$?

Are there infinitely many primes that are 1 more a square-free number?

A horrendous sieve with potentially terrific consequences

What is the upper bound for $\prod_{p|N}(1+p^{-1})$?

Small gaps between primes Maynard-Tao sieve why it works

Is there a name or theory for this sieve characteristic?

What are some good introductory textbooks on Sieve Theory?

For all prime $\ p > \ 2,\ p=2^x \cdot Ord_p(2)+1$?

Trending Questions

Popular # Hahtags

Popular Questions