Sequence of primes by trial division: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,576: / Line 2,576: @@
 primelist = []
 def primer(n):
+	for d in primelist:
-	exception = [1,vv,]
-	for x in range(2,n):
+		if d * d > n:
+			break
-		if vv%x == 0:
+		if n % d == 0:
-			exception.append(x)
+			return
-			if len(exception) > 2:
+	primelist.append(n)
-				continue
-	if len(exception) == 2:
-		primelist.append(exception[1])
-for vv in range(1,limiter):
+for vv in range(2, limiter):
 	primer(vv)
 print(len(primelist))
-print(primelist)</syntaxhighlight>
+print(*primelist)</syntaxhighlight>
 {{out}}
-<pre>26
+<pre>25
-[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>
+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}}==