Sampling Goldbach Numbers at Random
Ljuben Mutafchiev

TL;DR
This paper studies the distribution of Goldbach numbers obtained by randomly partitioning even integers into two odd primes, showing their scaled mean and variance converge to specific values using generating functions and Tauberian theorems.
Contribution
It provides a new probabilistic analysis of Goldbach numbers, establishing the asymptotic mean and variance of their scaled form.
Findings
Mean of G_n/n converges to 2/3
Variance of G_n/n converges to 1/18
Method uses generating functions and Hardy-Littlewood-Karamata theorem
Abstract
Let be the set of all partitions of the even integers from the interval into two odd prime parts. We select a partition from the set uniformly at random. Let be the number partitioned by this selection. is sometimes called a Goldbach number. In [6] we showed that converges weakly to the maximum of two random variables which are independent copies of a uniformly distributed random variable in the interval . In this note we show that the mean and the variance of tend to the mean and variance of , respectively. Our method of proof is based on generating functions and on a Tauberian theorem due to Hardy-Littlewood-Karamata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Benford’s Law and Fraud Detection · Random Matrices and Applications
