Primal Sums (James J. Youlton Jr) | Discuss about this problem |

Select 20 distinct positive integers that generate the most primes out of all the combinations of sums of the integers. Integers must be below 2^31-1, or if that seems too easy, set a limit of, say, 2^50-1. An optional second part could require the integers to all be prime (Primal Sums of Primes). |