Test case No. 5
x = 911;
y_correct = 911;
Should the nearest prime number for 911 have been 907?
how i can solve
which is wrong
Look. It's Size 80
I feel for you, typing in those endless arrays of prime numbers.
You have probably figured it out by now, but instead of typing in manually the vectors prim0 and prim1 and then checking memberships, you can just run the function 'isprime(x)' which will save you lots of space and time
Project Euler: Problem 9, Pythagorean numbers
295 Solvers
313 Solvers
417 Solvers
Integer Sequence - II : New Fibonacci
258 Solvers
197 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!