Prime numbers whose neighboring pairs are tetraprimes: Difference between revisions
Content added Content deleted
(→{{header|Go}}: Updated in line with Wren version of which it's a translation - about 5 times quicker than before.) |
m (→{{header|C}}: small improvement for isTetraPrime, to stop earlier. Runtime @home 0.1s -> 0.068 s) |
||
| Line 197: | Line 197: | ||
bool isTetraPrime(int n) { |
bool isTetraPrime(int n) { |
||
size_t i; |
size_t i; |
||
int p, count = 0, prevFact = 1; |
int p,limit, count = 0, prevFact = 1; |
||
for (i = 0; i < size; ++i) { |
for (i = 0; i < size; ++i) { |
||
p = primes[i]; |
p = primes[i]; |
||
limit = p*p; |
|||
switch (count){ |
|||
case 0: |
|||
limit *= limit; |
|||
break; |
|||
case 1: |
|||
limit *= p; |
|||
break; |
|||
} |
|||
if (limit <= n) { |
|||
while(!(n%p)) { |
while(!(n%p)) { |
||
if (count == 4 || p == prevFact) return false; |
if (count == 4 || p == prevFact) return false; |
||