Sampling Goldbach Numbers at Random
Abstract
Let 2n be the set of all partitions of the even integers from the interval (4,2n], n>2, into two odd prime parts. We select a partition from the set 2n uniformly at random. Let 2Gn be the number partitioned by this selection. 2Gn is sometimes called a Goldbach number. In [6] we showed that Gn/n converges weakly to the maximum T of two random variables which are independent copies of a uniformly distributed random variable in the interval (0,1). In this note we show that the mean and the variance of Gn/n tend to the mean μT=2/3 and variance σT2=1/18 of T, respectively. Our method of proof is based on generating functions and on a Tauberian theorem due to Hardy-Littlewood-Karamata.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.