Problem 44793. Project Euler 249: Prime Subset Sums

Created by li haitao in Community

Inspired by Problem 249 of Project Euler.

Let S = {2, 3, 5, ...} be the set of prime numbers less than N.

Find the number of subsets of S, the sum of whose elements is a prime number. Enter the rightmost 16 digits as your answer. The answer must be a uint64 integer.

Solution Stats

56.25% Correct | 43.75% Incorrect
Last solution submitted on Apr 19, 2019