How to Detect prime numbers?

Question

between 2-1000

Answer 1

To detect if a number n is prime, check if any number from 2 to square root of n divides n.
To find all primes in a range (2 - 1000), you can use sieve of erathosthenes, described here
https://www.sololearn.com/learn/969/?ref=app

Answer 2

oh, didn't see that one, sloppy

Answer 3

this code contains a function that detects primes.
you can use it on every number in the range.
https://code.sololearn.com/c7I7yNzPppBS/?ref=app

Answer 4

Debjit Mutsuddi
You can find some codes in the comments of the task linked by michal

Answer 5

davy hermans Your code gives wrong answer for 2.
It is not actuallynecessary to iterate to n/2, square root of n suffices

Answer 6

Debjit Mutsuddi , thanks. Fixed it.

Answer 7

can't find the code

Answer 8

but thanx anyway

Answer 9

thanx

Answer 10

davy hermans Still doesn't work. Put return true outside of the loop