# A heuristic asymptotic formula concerning the distribution of prime numbers

@article{Bateman1962AHA,
title={A heuristic asymptotic formula concerning the distribution of prime numbers},
author={P. T. Bateman and Roger A. Horn},
journal={Mathematics of Computation},
year={1962},
volume={16},
pages={363-367}
}
• Published 1 September 1962
• Mathematics
• Mathematics of Computation
Suppose fi, f2, -*, fk are polynomials in one variable with all coefficients integral and leading coefficients positive, their degrees being hi, h2, **. , hk respectively. Suppose each of these polynomials is irreducible over the field of rational numbers and no two of them differ by a constant factor. Let Q(fi , f2, ... , fk ; N) denote the number of positive integers n between 1 and IV inclusive such that fi(n) , f2(n), , fk(n) are all primes. (We ignore the finitely many values of n for…
252 Citations
Let G(x) be an irreducible polynomial with integer coefficients. It is conjectured that the set {n ∈ N : G(n) is prime} is infinite for most G(x). If Pr denotes the set of squarefree positive
An Asymptotic Formula for the Number of Smooth Values of a Polynomial
Although we expect to find many smooth numbers (i.e., numbers with no large prime factors) among the values taken by a polynomial with integer coefficients, it is unclear what the asymptotic number
On the bateman-horn conjecture
Abstract Let r be a positive integer and f 1 ,…, f r be distinct polynomials in Z [ X ]. If f 1 ( n ),…, f r ( n ) are all prime for infinitely many n , then it is necessary that the polynomials f i
Least primes in arithmetic progressions
For a xed non-zero integer a and increasing function f, we investigate the lower density of the set of integers q for which the least prime in the arithmetic progression a(mod q) is less than qf(q).
OF THE AMERICAN MATHEMATICAL SOCIETY Volume 11 , Number 1 , July 1984 PRIME VALUES OF POLYNOMIALS AND IRREDUCIBILITY TESTING BY
In 1857 Bouniakowsky  made a conjecture concerning prime values of polynomials that would, for instance, imply that x + 1 is prime for infinitely many integers x. Let ƒ (x) be a polynomial with
ON THE SUMS OF COMPLEMENTARY DIVISORS
• Mathematics
• 2007
In this paper, we study various arithmetic properties of d + n/d, where d runs through all the τ(n) positive divisors of n. For example, denoting by ϖ(n) the number of prime values among these sums,
Mean value one of prime-pair constants
• Mathematics
• 2008
For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x)
PRIME VALUES OF POLYNOMIALS AND IRREDUCIBILITY TESTING BY KEVIN S. McCURLEY
In 1857 Bouniakowsky  made a conjecture concerning prime values of polynomials that would, for instance, imply that x + 1 is prime for infinitely many integers x. Let ƒ (x) be a polynomial with
The primes contain arbitrarily long polynomial progressions
• Mathematics
• 2006
We establish the existence of infinitely many polynomial progressions in the primes; more precisely, given any integer-valued polynomials P1, …, Pk ∈ Z[m] in one unknown m with P1(0) = … = Pk(0) = 0,
Average Bateman--Horn for Kummer polynomials
• Mathematics
• 2020
For any $r \in \mathbb{N}$ and almost all $k \in \mathbb{N}$ smaller than $x^r$, we show that the polynomial $f(n) = n^r + k$ takes the expected number of prime values as $n$ ranges from 1 to $x$. As