Using a parity-sensitive sieve to count prime values of a polynomial (Q4340414)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using a parity-sensitive sieve to count prime values of a polynomial |
scientific article; zbMATH DE number 1019345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using a parity-sensitive sieve to count prime values of a polynomial |
scientific article; zbMATH DE number 1019345 |
Statements
Using a parity-sensitive sieve to count prime values of a polynomial (English)
0 references
20 August 1997
0 references
sieve
0 references
parity
0 references
prime
0 references
polynomial
0 references
number of primes in thin sequences
0 references
Gaussian primes
0 references
