Problem 234. Project Euler: Problem 3, Largest prime factor
Solution Stats
Problem Comments
-
1 Comment
good level
Solution Comments
-
1 Comment
not good, doesn't work for prime numbers
My idea was like Solution 1669655, that one is much better
-
1 Comment
The last test is not appropriate. 13916767508299776 exceeds flintmax, eg. 9.007199254740992e+15. It causes precision problem when it is passed to euler003.
-
1 Comment
I am failing to pass the last test of this code ,I am using max and factor ,any hint to pass last , 7th number test?
-
1 Comment
why it is not accepting the answer ;we cant make such small solutions we are not like professional coder
-
2 Comments
still something fishy with the 3rd problem, example:
x = uint64(321676750829977632);
num2str(x) -> 321676750829977600
rem(x,10) -> 0
euler003(x) -> 83653987
...?
ok now, it seems this was only an issue with my matlab version (7.7) but was not present in the version running the solvers (which seems to have uint64 arithmetic supported!, man, I need an upgrade...)
-
3 Comments
You should pass the x values as a string. A double precision number cannot resolve all the digits that one needs to solve the test suite problems:
>> x = 321676750829977632;
>> x == x+1
ans =
1
I agree that there is an issue with the last test suite problem. passing it as a uint64 would work too.
Yep I got "Error: Out of memory. Type HELP MEMORY for your options." :-)
Problem Recent Solvers1038
Suggested Problems
-
4830 Solvers
-
Similar Triangles - find the height of the tree
253 Solvers
-
454 Solvers
-
161 Solvers
-
4635 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!