If we want to know whether a certain range of numbers, say between x and y, contain prime or not. Do we use only the division method by all the prime less than the square root of y. If all the number are divisible, then there are no prime in that region. Because according to the above method, if we want to know bigger prime, we need to know all the prime less than the square root of that number. Thanks.