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 10, Sum of Primes
Acid and water
Matrix indexing with two vectors of indices
Fix the last element of a cell array
Sum of odd numbers in a matrix
Extra safe primes
Maximum of each diagonal
Cumulative minimum of an array
List of built-in demo images
Return elapsed time
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office