Problem 44793. Project Euler 249: Prime Subset Sums
Solution Stats
Problem 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.
Problem Recent Solvers18
Suggested Problems
-
2391 Solvers
-
Sum all integers from 1 to 2^n
12497 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
449 Solvers
-
283 Solvers
-
1202 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!