New quadratic polynomials with high densities of prime values |
| |
Authors: | Michael J Jacobson Jr Hugh C Williams |
| |
Institution: | Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2 ; Department of Mathematics and Statistics, MS 360, 2500 University Drive N.W., University of Calgary, Calgary, Alberta, Canada T2N 1N4 |
| |
Abstract: | Hardy and Littlewood's Conjecture F implies that the asymptotic density of prime values of the polynomials , is related to the discriminant of via a quantity The larger is, the higher the asymptotic density of prime values for any quadratic polynomial of discriminant . A technique of Bach allows one to estimate accurately for any , given the class number of the imaginary quadratic order with discriminant , and for any given the class number and regulator of the real quadratic order with discriminant . The Manitoba Scalable Sieve Unit (MSSU) has shown us how to rapidly generate many discriminants for which is potentially large, and new methods for evaluating class numbers and regulators of quadratic orders allow us to compute accurate estimates of efficiently, even for values of with as many as decimal digits. Using these methods, we were able to find a number of discriminants for which, under the assumption of the Extended Riemann Hypothesis, is larger than any previously known examples. |
| |
Keywords: | Prime-generating quadratic polynomial quadratic order class group |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
| 点击此处可从《Mathematics of Computation》下载免费的PDF全文 |
|