Almost Primes
Almost Primes is a number-theoretic construct in sieve methods denoting a natural number with a bounded number of prime factors, counted with multiplicity, that distinguishes it from primes by allowing a small, explicitly controlled deviation in primality.
53
Publications
2.4K
Citations
71
Authors
59
Institutions
Publications per year
2017–2026
2
Parents
53
The primes contain arbitrarily long arithmetic progressions
Benjamin Green, Terence Tao · Annals of Mathematics · 2008 · 822 citations · Full text
Almost all primes can be quickly certified
S. Goldwasser, Joe Kilian · 1986 · 201 citations · Full text
Almost-primes represented by quadratic polynomials
Henryk Iwaniec · Inventiones mathematicae · 1978 · 136 citations
Keiji Oguiso · Mathematical Research Letters · 2002 · 85 citations · Full text
1–5 of 53
71
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 71
59
Shandong University
Jinan, China
5 h-index
6 publications
171 citations
Institute of Mathematics, Academia Sinica
Taipei, Taiwan
2 h-index
3 publications
42 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
3 publications
39 citations

Iwate University
Morioka, Japan
2 h-index
2 publications
98 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
858 citations

Nihon University
Tokyo, Japan
2 h-index
2 publications
22 citations
University of Oxford
Oxford, United Kingdom
2 h-index
2 publications
21 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
858 citations
1–8 of 59
5 publications · 115 citations
5
h-index
3 publications · 36 citations
3
h-index
3 publications · 120 citations
3
h-index
3 publications · 84 citations
3
h-index
2 publications · 61 citations
2
h-index
1–5