Almost-prime values of polynomials at prime arguments

DOI10.1112/BLMS/BDV035zbMATH Open1335.11077arXiv1410.3333OpenAlexW2257367384MaRDI QIDQ5501658FDOQ5501658

Authors: Alastair. J. Irving 

Publication date: 14 August 2015

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $mathbbZ$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the degree is large, there are infinitely many primes $p$ for which $f(p)$ has at most $degf+O(logdegf)$ prime factors.

Full work available at URL: https://arxiv.org/abs/1410.3333

Recommendations

• Almost-prime values of reducible polynomials at prime arguments
• scientific article; zbMATH DE number 1101378
• Quadratic polynomials at prime arguments
• Power‐free values of polynomials
• Almost-prime polynomials at prime arguments

zbMATH Keywords

sieve methodsalmost-primes in polynomial sequences

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Cites Work

• Bounded gaps between primes
• Selberg's sieve with weights
• New equidistribution estimates of Zhang type
• Title not available (Why is that?)
• Almost-primes represented by quadratic polynomials

Cited In (17)

• Almost-prime values of binary forms with one prime variable
• A weighted Turán sieve method
• Regularity of primes associated with polynomial parametrisations
• On a new approach to selecting the parameters of a two-dimensional sieve with weights
• Almost primes in various settings
• Quadratic polynomials at prime arguments
• Average Bateman–Horn for Kummer polynomials
• Almost-primes represented by quadratic polynomials
• About Polynomials Whose Divided Differences are Integer-Valued on Prime Numbers
• Polynomials with Large Numbers of Prime Values
• Title not available (Why is that?)
• Prime values of meromorphic functions and irreducible polynomials
• Normality of numbers generated by the values of polynomials at primes
• Almost-prime polynomials at prime arguments
• Almost-prime values of reducible polynomials at prime arguments
• Une Caractérisation des Polynômes Prenant des Valeurs Entières Sur Tous les Nombres Premiers
• Polynomials with no Small Prime Values

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)