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 8, Find largest product in a large string of numbers
Return the Fibonacci Sequence
Create a vector whose elements depend on the previous element
multiply by three
Pentago: find winning move
Calculate a modified Levenshtein distance between two strings
Create cell array of strings
Create a figure and plot data
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