var primes : array 2 .. 99999999 of boolean

proc findprime (num : int)
    var counter := 0
    var n : real
    for decreasing i : num-1 .. 2
        n := num / i
        if round (n) = n then
            counter += 1
        else
            counter := counter
        end if
    end for
    if counter = 0 then
        primes (num) := true
    else
        primes (num) := false
    end if
end findprime

for i : 2 .. 99999999
    findprime (i)
end for

for i : 2 .. 99999999
    if primes (i) = true then
        put i, " is a prime"
    else
        put i, " is not a prime"
    end if

end for