EXPRESSING INTEGERS AS SUMS OF MANY DISTINCT PRIMES
Let can be partitioned into distinct primes, i.e. ncan be written as the sum of distinct for all sufficiently large positive integers n. We show that is defined for all i.e. every integer can be partitioned into two or more distinct primes, and we find a nontrivial initial lower bound approaching and an integer such that for all We pose finding an optimal lower bound for as a challenge to the research community.
prime numbers, partitions.