Hello everyone, I would like to write a function to find the prime number from 0 to n . I would apreciate your help!

 3 5 7......n

[Walter Roberson]

1 is not a prime number.

[nawal shaikh]

oh yes of course, I will correct this mistake .. thank you

[Honglei Chen]

but 2 should be

[Walter Roberson]

(Volunteers, please do not post complete code for this question, as it is an introductory programming question designed to help people learn how to think about programming. Making mistakes and learning how to debug is an important part of this task that would not be learned if code is given.)

[Sean de Wolski]

I think my answer here should do:

Old Answer

Answer 1

[Matt Fig]

p = @(n) primes(n);

[nawal shaikh]

I want to write another function by using m-file,if,for,break .....not call the available one.. thank you

[Honglei Chen]

you can take a peek at the primes function

edit primes

Answer 2

[Jan]

Look in the internet for "sieve of Eratosthenes". You will find smart algorithms which can be implemented in Matlab directly.