A Note on Goldbach Partitions of Large Even Integers

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 show that |Σ2n | ∼ 2n2 / log2 n as n → ∞. We also assume that a partition is selected uniformly at random from the set Σ2n. Let 2Xn ∈ (4, 2n] be the size of this partition. We prove a limit theorem which establishes that Xn/n converges weakly to the maximum of two random variables which are independent copies of a uniformly distributed random variable in the interval (0, 1). Our method of proof is based on a classical Tauberian theorem due to Hardy, Littlewood and Karamata. We also show that the same asymptotic approach can be applied to partitions of integers into an arbitrary and fixed number of odd prime parts. 1 Introduction and Statement of the Main Result For a given sequence of positive integers Λ = {λ1, λ2,...}, by a Λ-partition of the positive integer n, we mean a way of writing it as a sum of positive integers from Λ without regard to order; the summands are called parts. Let P = {p1, p2,...} be the sequenc