Pairs with common factors: Difference between revisions
m
Minor code improvement.
m (Minor formatting of text.) |
m (Minor code improvement.) |
||
Line 664:
listTotients(maximum);
long[] pairsCount = new long[maximum + 1];
long totientSum =
for ( int number = 1; number <= maximum; number++ ) {
Line 677:
System.out.println("The first one hundred terms of the number of pairs with common factors:");
for ( int number = 1; number <= 100; number++ ) {
System.out.print(String.format("%
}
System.out.println();
Line 697:
if ( totients[i] == i ) {
totients[i] = i - 1;
for ( int j = i * 2; j <= maximum;
totients[j] = ( totients[j] / i ) * ( i - 1 );
}
Line 705:
private static void listPrimeNumbers(int maximum) {
final int
boolean[] composite = new boolean[
for ( int i = 1, p = 3; i <
if ( ! composite[i] ) {
for ( int j = i + p; j <
composite[j] = true;
}
Line 716:
primes = new ArrayList<Integer>(List.of( 2 ));
for ( int i = 1, p = 3; i <
if ( ! composite[i] ) {
primes.add(p);
| |||