On the Density of Primes of the form X^2+c
DOI:
https://doi.org/10.14738/tecs.116.15890Keywords:
density of primes, large primes, quadratic form, arithmetic sequence, constant densityAbstract
We present a method for finding large fixed-size primes of the form . We study the density of primes on the sets,. We describe an algorithm for generating values of such that a given prime is the minimum of the union of prime divisors of all elements in. We also present quadratic forms generating divisors of and study the prime divisors of its terms. This paper uses the results of Dirichlet's arithmetic progression theorem [1] and the article [6] to rewrite a conjecture of Shanks [2] on the density of primes in . Finally, based on these results, we discuss the heuristics of large primes occurrences in the research set of our algorithm.
References
A. Selberg, « An elementary proof of Dirichlet's theorem about primes in an arithmetic progression », Ann. Math., vol. 50, no 2, 1949, p. 297-304 (JSTOR 1969454, zbMATH 0036.30603).
Shanks, Daniel. “On the Conjecture of Hardy & Littlewood Concerning the Number of Primes of the Form n2 + a.” Mathematics of Computation, vol. 14, no. 72, 1960, pp. 321–32. JSTOR, https://doi.org/10.2307/2003891.
Jean-Pierre Serre, « Quelques applications du théorème de densité de Chebotarev », Publ. Math. IHES, vol. 54, 1981, p. 123-201. https://eudml.org/doc/103977.
Marc WOLF, François WOLF (2018), Representation theorem of composite odd numbers indices. SCIREA Journal of Mathematics, Vol. 3, pp. 106-117. http://article.scirea.org/pdf/11066.pdf.
Marc WOLF, François WOLF (2020). Primality test and primes enumeration using odd numbers indexation. Transactions on Machine Learning and Artificial Intelligence, 8(2), 11–41. https://doi.org/10.14738/tmlai.82.8054
Marc WOLF, François WOLF (2022). On the Factorization of Numbers of the Form X^2+c. Transactions on Engineering and Computing Sciences, 10(4), 59–77. https://doi.org/10.14738/tmlai.104.12959
Robert J. Lemke Oliver (Atlanta, GA), Almost-primes represented by quadratic polynomials, ACTA ARITHMETICA, 151.3 (2012), DOI: 10.4064/aa151-3-2
Hardy, G.H., Littlewood, J.E. Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes. Acta Math. 44, 1–70 (1923). https://doi.org/10.1007/BF02403921
Bateman, Paul T., and Roger A. Horn. “A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers.” Mathematics of Computation, vol. 16, no. 79, 1962, pp. 363–67. JSTOR, https://doi.org/10.2307/2004056.
Marc WOLF, François WOLF, Corentin LE COZ (2018), Calculation of extended gcd by normalization. SCIREA Journal of Mathematics. Vol. 3, pp. 118-131. http://article.scirea.org/pdf/11067.pdf. External Links [EL1] Algorithm to compute the c values such as the first prime divisor of form X2+c.pdf [EL2] Algorithm to compute the large c values such as the first prime divisor of form X2+c.pdf [EL3] Data and results.pdf [EL4] Values of hc and dc for q1=727 and mc=301.ods [EL5] Two primes with 50 001 digits.txt [EL6] The c values with more than 25 and 50 million of digits.pdf [EL7] List of the pairs of values for q1.zip Wolf, M., & Wolf, F. (2023). On The Density of Primes of The Form X^2+c. Transactions on Engineering and Computing Sciences, 11(6). 80-105.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Wolf Marc, Wolf François

This work is licensed under a Creative Commons Attribution 4.0 International License.