Erdős-Nicolas numbers: Difference between revisions

Line 472:
Arrays.fill(divisorCount, 1);
for ( int index = 2; index <= limit / 2; index++index ) {
for ( int number = 2 * index; number <= limit; number += index ) {
if ( divisorSum[number] == number ) {
Line 480:
divisorSum[number] += index;
++divisorCount[number]++;
}
}
871

edits