Problem 53965. Easy Sequences 67: Project Euler Problem 1 - Not Again!!!
Solution Stats
Problem Comments
-
2 Comments
Ramon Villamangca
on 27 Jan 2022
Hi David,
I avoided exceeding 'flintmax', minimized multiplication, division and conditional statements. For small n's, like in test 7, | only used a simple sieving algorithm. I also checked my solution with Elixir, and Java and I still get the same result for test 7.
David Hill
on 27 Jan 2022
I initially did a sieving algorithm, but it was not efficient enough for large n. I did not consider splitting with two different algorithms.
Solution Comments
Problem Recent Solvers2
Suggested Problems
-
The Goldbach Conjecture, Part 2
1732 Solvers
-
31 Solvers
-
Are all the three given point in the same line?
331 Solvers
-
Reverse the elements of an array
774 Solvers
-
Volume difference between Ellipsoid and Sphere
105 Solvers
More from this Author66
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!