Strange unique prime triplets: Difference between revisions
m
Minor edit to Java code
(add Fermat) |
m (Minor edit to Java code) |
||
Line 1,005:
int count = 0;
if (verbose)
System.out.printf("Strange unique prime triplets < %d:\n", limit);
for (int i = 0; i + 2 < n; ++i) {
for (int j = i + 1; j + 1 < n; ++j) {
Line 1,014:
++count;
if (verbose)
System.out.printf("%2d + %2d + %2d = %2d\n", primes[i], primes[j], primes[k], sum);
}
}
}
}
System.out.printf("\nCount of strange unique prime triplets < %d is %d.\n", limit, count);
}
Line 1,042:
}
return sieve;
}
}</lang>
| |||