Upper-bound conjecture for Pomerance's constant
Upper-bound conjecture for Pomerance's constant
Let denote Pomerance's constant, the sum of the reciprocals of all amicable numbers. Based on the observed convergence of the partial sums , where is the sum of the reciprocals of amicable numbers not exceeding , one estimates the tail beyond by
Pomerance's upper-bound conjecture. Pomerance's constant satisfies
This is a numerical conjecture based on the apparent rapid convergence of the reciprocal sum and the available exhaustive search through . The supplied text gives no proof or resolution.
Sources & referencesView supporting material
Primary source
Jonathan Bayless and Dominic Klyve, “On the Sum of Reciprocals of Amicable Numbers”, arXiv:1101.0259 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.