首页 | 本学科首页   官方微博 | 高级检索  
     检索      


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 $f_A(x) = x^2 + x + A,$ $A \in \mathbb{Z}$, is related to the discriminant $\Delta = 1 - 4A$ of $f_A(x)$ via a quantity $C(\Delta).$ The larger $C(\Delta)$ is, the higher the asymptotic density of prime values for any quadratic polynomial of discriminant $\Delta$. A technique of Bach allows one to estimate $C(\Delta)$ accurately for any $\Delta < 0$, given the class number of the imaginary quadratic order with discriminant $\Delta$, and for any $\Delta > 0$ given the class number and regulator of the real quadratic order with discriminant $\Delta$. The Manitoba Scalable Sieve Unit (MSSU) has shown us how to rapidly generate many discriminants $\Delta$ for which $C(\Delta)$ is potentially large, and new methods for evaluating class numbers and regulators of quadratic orders allow us to compute accurate estimates of $C(\Delta)$ efficiently, even for values of $\Delta$ with as many as $70$decimal digits. Using these methods, we were able to find a number of discriminants for which, under the assumption of the Extended Riemann Hypothesis, $C(\Delta)$ is larger than any previously known examples.

Keywords:Prime-generating quadratic polynomial  quadratic order  class group
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号