If i is a prime number , then both minimum and maximum prime numbers that divide the number is the number itself
min_prime [ i ] = i ; max_prime [ i ] = i ; int j = i + i ; while ( j <= n ) { if ( min_prime [ j ] == 0 ) {