On a Different Method For Determining the Primary Numbers

Abstract

To date, a formula found and proven to generate prime numbers is not yet available in the literature [2]. Through trial-and-error, the search for prime numbers using mathematical cal- culations and algorithms continues. In this study, we gave a screening algorithm dierent from previous studies. We supported this method rst with the help of tables. Since we will work on set of the odd integers in our study, and every element of this set is likely to be prime, we named this set of numbers as a possible set of prime numbers and denoted this set with the letter Ms. To further narrow the single set of integers than the probability of being prime, we examined the nal digits of potentially prime numbers. It should be noted that the numbers in the last digit should end with one of the numbers 1, 3, 7 and 9, but the numbers that end in each of the last digits with one of these numbers are not prime. In this method, unlike other prime number tests, we have dened and used the numbers of possible.

Keywords

• Prime Numbers
• Prime Number Sieves
• Applications of Sieves Methods

References

1. 1 J.J O’Connor, J.J., Robertson, E.F., Prime Numbers, (2019), http://www-history.mcs.st-andrews.ac.uk/HistTopics/Primenumbers.html.
2. 2 https://www.mersenne.org/. Access date: 13.07.2020.
3. 3 C. Özgü, A Study on Prime Number Patterns and Goldbach Conjecture, Master Thesis, Ege University Institute of Science, International Computer Program, (2002).
4. 4 T. Yerlikaya, T., Kara, O., Prime Number Testing Algorithms Used in Cryptology, Trakya Uni.J.Eng.Sci., 18(1), (2017).