Do you know, that how to find Positive prime Numbers between in some interval? [a,b]

Lets see, How to find prime Numbers?

nc_eui2=v1%3AAeEb2EQT_0ILWfv6yroufLq8F29IbRAKffXvZ_7DBOBNIeoHrErXhCchzg-HecNn13z1cUgCLQTADNSrp4TuPCjNH5TlyxTm9YV_A9OF-ebfA&oh=b2f369f7f1aeab736d7dad2aa0fbd56e&oe=5ADCBAF5

First to define a little bit.

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example, 5 is prime because 1 and 5 are its only positive integer factors, whereas 6 is composite because it has the divisors 2 and 3 in addition to 1 and 6. The fundamental theorem of arithmetic establishes the central role of primes in number theory: any integer greater than 1 is either a prime itself or can be expressed as a product of primes that is unique up to ordering. The uniqueness in this theorem requires excluding 1 as a prime because one can include arbitrarily many instances of 1 in any factorization, e.g., 3, 1 · 3, 1 · 1 · 3, etc. are all valid factorizations of 3.
The property of being prime is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and √n. Algorithms much more efficient than trial division have been devised to test the primality of large numbers. These include the Miller–Rabin primality test, which is fast but has a small probability of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. As of January 2018, the largest known prime number has 23,249,425 decimal digits.
There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modelled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says that the probability that a given, randomly chosen number n is prime is inversely proportional to its number of digits, or to the logarithm of n.
Many questions regarding prime numbers remain open, such as Goldbach's conjecture (that every even integer greater than 2 can be expressed as the sum of two primes), and the twin prime conjecture (that there are infinitely many pairs of primes whose difference is 2). Such questions spurred the development of various branches of number theory, focusing on analytic or algebraic aspects of numbers. Primes are used in several routines in information technology, such as public-key cryptography, which makes use of properties such as the difficulty of factoring large numbers into their prime factors. Prime numbers give rise to various generalizations in other mathematical domains, mainly algebra, such as prime elements and prime ideals.

Now come to practice to find Prime Numbers

firstly, if you want to find a prime numbers between this interval [a, b] where a= 1 and b=15
then list all the numbers in lines as following...

[a, b]= [1, 15]
so remove the digit 1, because it isn't.

1 2 3 4 5 6 7 8 9
10 11 12 13 14 15

to remove "1"
2 3 4 5 6 7 8 9
10 11 12 13 14 15

now, cut all the numbers which is divisible by "2"

that is "2", "4", "6", "8", "10", "12", "14".
so list the above remaining numbers again.

3 5 7 9 11 15

now, cut all the numbers which is divisible by "3"
that is only number "15", so again list all the remaining digits below.

3 5 7 9 11

P= {3, 5, 7, 9, 11} ----------------- #)

therefore the hash shows us the set of prime Numbers between the interval [a, b]= [2, 15]

As a result you can find prime number between any interval [a, b]