Sequence of primes by trial division: Difference between revisions
Content added Content deleted
(Added solution for Action!) |
|||
| Line 2,638: | Line 2,638: | ||
if s <= n then k = k + 1 |
if s <= n then k = k + 1 |
||
divisible = false |
divisible = false |
||
m = 1 rem index |
m = 1 rem index into primes previously found |
||
while (m <= k) and (divisible = false) do |
while (m <= k) and (divisible = false) do |
||
begin |
begin |
||