Erdős-primes: Difference between revisions
→{{header|Wren}}: Further speed-up.
(→{{header|Wren}}: More efficient and 11 x quicker than before.) |
(→{{header|Wren}}: Further speed-up.) |
||
Line 1,438:
var lastErdos = 0
var ec = 0
while (i < limit) {
var
var
fact = fact * j▼
}▼
if (found) {▼
if (i < lowerLimit) erdos.add(i)▼
lastErdos = i
ec = ec + 1
}
▲ j = j + 1
▲ fact = fact * j
▲ }
▲ if (found) {
▲ if (i < lowerLimit) erdos.add(i)
▲ lastErdos = i
▲ ec = ec + 1
}
i = (i > 2) ? i + 2 : i + 1
}
| |||