Find the minimum number in [ low . . high ] that is a multiple of prime [ i ]
if ( loLim < low ) { loLim += ( int ) prime [ i ] ; } if ( loLim == ( int ) prime [ i ] ) { loLim += ( int ) prime [ i ] ; }