Problem 44793. Project Euler 249: Prime Subset Sums
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.
Solution Stats
Problem Comments
-
2 Comments
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).
At least those four lookup solutions inspired me to squeeze a bit harder to get down to 61.
Solution Comments
Show commentsWho Deserves Your Praise? Discover the New Contribution Widget!
Problem Recent Solvers18
Suggested Problems
-
2635 Solvers
-
2387 Solvers
-
Find out missing number from a vector of 9 elements
302 Solvers
-
233 Solvers
-
1832 Solvers
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!
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: United States.
You can also select a web site from the following list
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom(English)
Asia Pacific
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)