PRIME NUMBERS
Using this program you can find prime numbers in the given range of numbers. The program finds prime numbers in the fastest way possible
(unlike, for example, the Eratosthenes´s sieve method) because it is based on the optimal code. Only 0 and positive integers can be entered
in appropriate fields. Otherwise, a warning message appears. Also, the warning message appears in case the first number is greater than the
second, the second is less than 2 and in case nothing is entered. You can email me if you would like to get a list and the total number of prime
numbers in the given range of numbers as a file.