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
-
1026 Solvers
-
253 Solvers
-
59 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
177 Solvers
-
Find nearest prime number less than input number
459 Solvers
More from this Author101
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!