aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2023-07-22 21:42:12 -07:00
parent 9817d9b99b
commit 07c7092a52
140 changed files with 2712 additions and 241 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Task/Euclid-Mullin-sequence/Java/euclid-mullin-sequence.java
View file

@ -4,17 +4,16 @@ import java.util.BitSet;
import java.util.List;
import java.util.concurrent.ThreadLocalRandom;
public class EulerMullinSequence {
public final class EulerMullinSequence {
public static void main(String[] aArgs) {
primes = listPrimesUpTo(1_000_000);
System.out.println("The first 27 terms of the Euler-Mullin sequence:");
System.out.println(2);
System.out.print(2 + " ");
for ( int i = 1; i < 27; i++ ) {
System.out.println(nextEulerMullin());
System.out.print(String.format("%s%s", nextEulerMullin(), ( i == 14 || i == 27 ) ? "\n" : " "));
}
}
private static BigInteger nextEulerMullin() {
@ -25,7 +24,7 @@ public class EulerMullinSequence {
}
private static BigInteger smallestPrimeFactor(BigInteger aNumber) {
if ( aNumber.isProbablePrime(probabilityLevel) ) {
if ( aNumber.isProbablePrime(CERTAINTY_LEVEL) ) {
return aNumber;
}
@ -86,6 +85,6 @@ public class EulerMullinSequence {
private static BigInteger product = BigInteger.TWO;
private static ThreadLocalRandom random = ThreadLocalRandom.current();
private static final int probabilityLevel = 20;
private static final int CERTAINTY_LEVEL = 20;
}