From charlesreid1

Revision as of 21:19, 17 June 2026 by Admin (talk | contribs) (Create Project Euler/249 - Prime Subset Sums (via create-page on MediaWiki MCP Server))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem Statement

Prime Subset Sums

Let S = {2, 3, 5, ..., 4999} be the set of primes less than 5000.

Find the number of subsets of S whose sum is a prime number.

Enter the rightmost 16 digits of your answer.

Flags