Problem 44793. Project Euler 249: Prime Subset Sums

Created by li haitao

Solve Later

Inspired by Problem 249 of Project Euler. https://projecteuler.net/problem=249

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.

Solve

Solution Stats

67 Solutions
22 Solvers

Last Solution submitted on Dec 15, 2025

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Rafael S.T. Vieira on 11 Aug 2020

The tip for this one is that It is possible to solve it within MATLAB's precision by using mod(x,10^16). No need for Java or Python (arbitrary-precision arithmetic).

GeeTwo on 9 Jan 2023

At least those four lookup solutions inspired me to squeeze a bit harder to get down to 61.

Solution Comments

Show comments

Problem Recent Solvers22

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 44793. Project Euler 249: Prime Subset Sums

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers22

Suggested Problems

More from this Author4

Problem Tags

Community Treasure Hunt

Problem 44793. Project Euler 249: Prime Subset Sums

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers22

Suggested Problems

More from this Author4

Problem Tags

Community Treasure Hunt

Players