Almost-prime values of polynomials at prime arguments
From MaRDI portal
Abstract: We consider almost-primes of the form where is an irreducible polynomial over and runs over primes. We improve a result of Richert for polynomials of degree at least . In particular we show that, when the degree is large, there are infinitely many primes for which has at most prime factors.
Recommendations
Cites work
Cited in
(20)- Almost-prime polynomials at prime arguments
- On a new approach to selecting the parameters of a two-dimensional sieve with weights
- Almost-prime values of reducible polynomials at prime arguments
- Prime values of meromorphic functions and irreducible polynomials
- Almost-prime values of binary forms with one prime variable
- Polynomials with Large Numbers of Prime Values
- Polynomials with no Small Prime Values
- Une Caractérisation des Polynômes Prenant des Valeurs Entières Sur Tous les Nombres Premiers
- Normality of numbers generated by the values of polynomials at primes
- scientific article; zbMATH DE number 1101378 (Why is no real title available?)
- scientific article; zbMATH DE number 1992404 (Why is no real title available?)
- Quadratic polynomials at prime arguments
- About Polynomials Whose Divided Differences are Integer-Valued on Prime Numbers
- Almost-primes represented by quadratic polynomials
- Average Bateman–Horn for Kummer polynomials
- Almost primes in various settings
- Regularity of primes associated with polynomial parametrisations
- The sum of a prime power and an almost prime
- On primes of the form \(\lfloor\alpha_1p^{c_1}+\alpha_2p^{c_2}+\beta\rfloor \)
- A weighted Turán sieve method
This page was built for publication: Almost-prime values of polynomials at prime arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501658)