int function ( long arg0 ) { if ( arg0 < 17 ) return 6 ; return ( int ) Math . floor ( arg0 / ( Math . log ( arg0 ) - 1.5 ) ) ; }
get a high bound for pi n , the number of primes less or equal n. concode_field_sep PlaceHolder placeHolder concode_field_sep BigInt product concode_elem_sep BitSet sieveOfEratosthenes concode_elem_sep void sieveOfEratosthenes