On prime representing polynomials |
| |
| Authors: | Emil Grosswald |
| |
| Affiliation: | (1) Department of Mathematics, Temple University, Computer Building 038-16, 19122 Philadelphia, Pennsylvania, USA |
| |
| Abstract: | 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. |
| |
| Keywords: | Primes polynomials |
| 本文献已被 SpringerLink 等数据库收录！ |
|
