Using a parity-sensitive sieve to count prime values of a polynomial (Q4340414): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: John B. Friedlander / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Henryk Iwaniec / rank | |||
Normal rank | |||
Revision as of 04:08, 20 February 2024
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
