Abstract
AbstractComputing the reciprocal sum of sparse integer sequences with tight upper and lower bounds is far from trivial. In the case of Carmichael numbers or twin primes even the first decimal digit is unknown. For accurate bounds the exact structure of the sequences needs to be unfolded. In this paper we present explicit bounds for the sum of reciprocals of Proth primes with nine decimal digit precision. We show closed formulae for calculating the nth Proth number $$F_n$$
F
n
, the number of Proth numbers up to n, and the sum of the first n Proth numbers. We give an efficiently computable analytic expression with linear order of convergence for the sum of the reciprocals of the Proth numbers involving the $$\Psi $$
Ψ
function (the logarithmic derivative of the gamma function). We disprove two conjectures of Zhi-Wei Sun regarding the distribution of Proth primes.
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference16 articles.
1. Proth, F.: Theoremes sur les nombres premiers. Comptes rendus. de l’Académie des Sciences de Paris 87, 926 (1878)
2. Announcment of the largest known Proth prime. http://www.primegrid.com/forum_thread.php?id=7116#100757
3. Sierpinski, W.: Sur un problème concernant les nombres. Elemente der Mathematik 15, 73–74 (1960)
4. Erdős, P., Odlyzko, A.M.: On the density of odd integers of the form $$(p-1)2^{-n}$$ and related questions. J. Number Theory 11(2), 257–263 (1979)
5. Sun, X.G., Fang, J.H.: On the density of integers of the form $$(p-1)2^{-n}$$ in arithmetic progressions. Bull. Aust. Math. Soc. 78, 431–436 (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献