On prime representing polynomials
A heuristic method is presented to determine the number of primesp ≤x, represented by an irreducible polynomialf(n), without non-trivial fixed factor (f(y)<∈Z[y]; n∈Z. The method is applied to two specific polynomials and the results are compared with those of the heuristic approach of Hardy and Littlewood.
Volume 130, 2020
Continuous Article Publishing mode
Click here for Editorial Note on CAP Mode