Sequence of primes by trial division: Difference between revisions

m
(Added solution for Action!)
Line 2,638:
if s <= n then k = k + 1
divisible = false
m = 1 rem index ofinto possibleprimes divisorspreviously found
while (m <= k) and (divisible = false) do
begin
211

edits