use $36$ Version$1$

for each number n from $2$ to the given number:

set isPrime to true

for each number m from $2$ to n$-1$:

if n is divisible by m:

set isPrime to false

break

if isPrime is true:

print n

Version $2$

for each number n from $2$ to the given number:

set isPrime to true

for each number m from $2$ to the square root of n:

if n is divisible by m:

set isPrime to false

break

if isPrime is true:

print n

Version $3$

print $2$

for each odd number n from $3$ to the given number:

set isPrime to true

for each odd number m from $3$ to the square root of n:

if n is divisible by m:

set isPrime to false

break

if isPrime is true:

print n