Sampling Goldbach Numbers at Random

Abstract: Let

S i g m a_{2 n}

be the set of all partitions of the even integers from the interval

(4, 2 n], n > 2,

into two odd prime parts. We select a partition from the set

S i g m a_{2 n}

uniformly at random. Let

2 G_{n}

be the number partitioned by this selection.

2 G_{n}

is sometimes called a Goldbach number. In [6] we showed that

G_{n} / 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

G_{n} / n

tend to the mean

m u_{T} = 2 / 3

and variance

s i g m a_{T}^{2} = 1 / 18

of

T

, respectively. Our method of proof is based on generating functions and on a Tauberian theorem due to Hardy-Littlewood-Karamata.

This page was built for publication: Sampling Goldbach Numbers at Random