Problem 44793. Project Euler 249: Prime Subset Sums

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

50.0% Correct | 50.0% Incorrect
Last Solution submitted on Jan 09, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers18

Suggested Problems

More from this Author4

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!