Sampling Goldbach Numbers at Random
Number Theory
2015-08-20 v1 Combinatorics
Probability
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.
Cite
@article{arxiv.1508.04457,
title = {Sampling Goldbach Numbers at Random},
author = {Ljuben Mutafchiev},
journal= {arXiv preprint arXiv:1508.04457},
year = {2015}
}