Weighted sieves with switching
Abstract: Weighted sieves are used to detect numbers with at most $S$ prime factors with $S \in \mathbb{N}$ as small as possible. When one studies problems with two variables in somewhat symmetric roles (such as Chen primes, that is primes $p$ such that $p+2$ has at most two prime factors), one can utilize the switching principle. Here we discuss how different sieve weights work in such a situation, concentrating in particular on detecting a prime along with a product of at most three primes. As applications, we improve on the works of Yang and Harman concerning Diophantine approximation with a prime and an almost prime, and prove that, in general, one can find a pair $(p, P_3)$ when both the original and the switched problem have level of distribution at least $0.267$.
- Ternary problems in additive prime number theory. In Analytic number theory (Beijing/Kyoto, 1999), volume 6 of Dev. Math., pages 39–91. Kluwer Acad. Publ., Dordrecht, 2002.
- Jing Run Chen. On the representation of a larger even integer as the sum of a prime and the product of at most two primes. Sci. Sinica, 16:157–176, 1973.
- É. Fouvry and F. Grupp. Weighted sieves and twin prime type equations. Duke Math. J., 58(3):731–748, 1989.
- Opera de cribro, volume 57 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2010.
- George Greaves. Sieves in number theory, volume 43 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]. Springer-Verlag, Berlin, 2001.
- Almost-primes in short intervals. In Recent progress in analytic number theory, Vol. 1 (Durham, 1979), pages 69–101. Academic Press, London-New York, 1981.
- H. Halberstam and H.-E. Richert. Sieve methods, volume No. 4 of London Mathematical Society Monographs. Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York, 1974.
- Glyn Harman. Diophantine approximation with a prime and an almost-prime. J. London Math. Soc. (2), 29(1):13–22, 1984.
- Glyn Harman. Prime-detecting sieves, volume 33 of London Mathematical Society Monographs Series. Princeton University Press, Princeton, NJ, 2007.
- Koichi Kawada. Note on the sum of cubes of primes and an almost prime. Arch. Math. (Basel), 69(1):13–19, 1997.
- P. Kuhn. Neue Abschätzungen auf Grund der Viggo Brunschen Siebmethode. In Tolfte Skandinaviska Matematikerkongressen, Lund, 1953, pages 160–168. Lunds Universitets Matematiska Institution, Lund, 1954.
- Pavel Kuhn. Zur Viggo Brun’schen Siebmethode. I. Norske Vid. Selsk. Forh., Trondhjem, 14(39):145–148, 1941.
- An additive problem over Piatetski-Shapiro primes and almost-primes. Ramanujan J., 57(4):1307–1333, 2022.
- R. C. Vaughan. Diophantine approximation by prime numbers. III. Proc. London Math. Soc. (3), 33(1):177–192, 1976.
- J. Wu. Chen’s double sieve, Goldbach’s conjecture and the twin prime problem. Acta Arith., 114(3):215–273, 2004.
- J. Wu. Chen’s double sieve, Goldbach’s conjecture and the twin prime problem. II. Acta Arith., 131(4):367–387, 2008.
- Liyang Yang. Diophantine inequalities involving a prime and an almost-prime. J. Number Theory, 170:347–367, 2017.
- Lilu Zhao. On products of primes and almost primes in arithmetic progressions. Acta Arith., 204(3):253–267, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.