Rosetta Code

Sequence of primes by trial division: Difference between revisions

Page Discussion

Sequence of primes by trial division (view source)

Revision as of 00:22, 6 February 2023

112 bytes removed ,  1 year ago
→‎Fun With Lists: fix, simplify, massiv speed-up
(Added uBasic/4tH version)
(→‎Fun With Lists: fix, simplify, massiv speed-up)
Line 2,576:
primelist = []
def primer(n):
for d in primelist:
exception = [1,vv,]
for if xd in* d > range(2,n):
break
if vvn %x d == 0:
exception.append(x)▼
return
if len(exception) > 2:
▲ exception primelist.append(xn)
continue
if len(exception) == 2:
primelist.append(exception[1])
 
for vv in range(12, limiter):
primer(vv)
 
print(len(primelist))
print(*primelist)</syntaxhighlight>
 
{{out}}
<pre>2625
[1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]</pre>
 
=={{header|Quackery}}==
Querfeld
559

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/336530"