Honaker primes: Difference between revisions
m
Minor code improvement.
(New post without using external libraries, in addition to an existing post which uses the "Primesieve" lexternal ibrary.) |
m (Minor code improvement.) |
||
Line 883:
import java.util.ArrayList;
import java.util.List;
public final class HonakerPrimes {
Line 913 ⟶ 911:
private static int digitalSum(int number) {
return String.valueOf(number).chars().map( i -> i - (int) '0' ).sum();
}
private static void sievePrimes(int limit) {
boolean[] composite = new boolean[halfLimit];
if ( ! composite[i] ) {
primes.add(p);
for ( int a = i + p; a < halfLimit; a
composite[a] = true;
}
}
}
▲ }
▲ primes.add(p);
private static int honakerIndex = 0;
private static int primeIndex = 0;
private static List<Integer> primes = new ArrayList<Integer>();
private static record HonakerPrime(int honakerIndex, int primeIndex, int prime) {
| |||