Blum integer: Difference between revisions
m
Code using an iImproved algorithm.
(→{{header|RPL}}: comment on the FACTORS command) |
m (Code using an iImproved algorithm.) |
||
Line 401:
=={{header|Java}}==
<syntaxhighlight lang="java">
import java.util.HashMap;
import java.util.Map;
Line 410 ⟶ 408:
public static void main(String[] aArgs) {
int[] blums = new int[50];
int blumCount = 0;
Line 420 ⟶ 414:
while ( blumCount < 400_000 ) {
final int prime =
if
final int quotient = number / prime;
if ( quotient != prime &&
if ( blumCount < 50 ) {
blums[blumCount] = number;
Line 450 ⟶ 444:
}
}
number += ( number % 5 == 3 ) ?
}
} ▼
private static int[] leastPrimeFactors(int aLimit) {▼
for ( int i = 2; i * i <= aLimit; i++ ) {▼
for ( int k = i * i; k <= aLimit; k += i ) {▼
if ( result[i] == 0 ) { ▼
return result;▼
}
private static
if ( aNumber < 2 ) { return false; }
if ( aNumber % 3 == 0 ) { return aNumber == 3; }
if ( aNumber % divisor == 0 ) { return false; }
▲ if ( i % 4 == 3 ) {
}
return
}
if ( aNumber % 3 == 0 ) { return 3; }
if ( aNumber % 5 == 0 ) { return 5; }
if ( aNumber % divisor == 0 ) { return divisor; }
}
}
| |||