Using a parity-sensitive sieve to count prime values of a polynomial (Q4340414): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q24684768, #quickstatements; #temporary_batch_1712286835472 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1073/pnas.94.4.1054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985056301 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q24684768 / rank | |||
Normal rank | |||
Latest revision as of 06:57, 5 April 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
