Some Properties and Algorithms for Twin Primes
Source abstract
Abstract
In this article, we study some new properties of twin primes and algorithms for their generation. We find the necessary conditions to generate a pair of twins. These conditions seem to indicate that the conjecture is true, namely, there are infinitely many twin primes. Furthermore, we developed some algorithms that are very useful from a computer science point of view, which can be applied in cryptography and data encryption.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Analytic Number Theory Research · Coding theory and cryptography · Mathematics and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Computer Science, University of Salerno, via Giovanni Paolo II, 132, 84084 Fisciano, SA, Italy
Department of Mathematics, University of Salerno, via Giovanni Paolo II, 132, 84084 Fisciano, SA, Italy
References (25)
Show source-provided references
1. Recherches analytiques sur la theorie des nombres premiers
2. Variae observations circa series infinitas
3. Sur la distribution des zeros de la function ς(s) et ces consequences aritmetiques10.24033/bsmf.545 ↗
4. Riemann, B. (1859). Uber die Anzahl der Primzahlen unter einer gegebenen Groβe. Monatsberichte Berl. Akad., 671–680.
5. A heuristic asymptotic formula concerning the distribution of prime numbers10.1090/S0025-5718-1962-0148632-7 ↗
6. The distribution of prime numbers: The solution comes from dynamical processes and genetic algorithms10.1016/j.chaos.2007.10.017 ↗
7. Naser, S.M. (2021). Some characterizations of twin prime numbers and their application. Master Sci. Thesis, Available online: http://lib.buet.ac.bd:8080/xmlui/handle/123456789/6036.
8. An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding10.1080/09720529.2014.894311 ↗
9. A Study of Relationship between RSA Public Key Cryptosystem and Goldbach’s Conjecture Properties
10. Boatto, A. (2018). Key Cryptography RSA. SSRN Electron. J.10.2139/ssrn.3192600 ↗
11. Trace formula in non-commutative geometry and the zeros of the Riemann zeta function10.1007/s000290050042 ↗
12. The difference of consecutive primes10.1215/S0012-7094-40-00635-4 ↗
13. A history of the prime number theorem10.1080/00029890.1973.11993338 ↗
14. On the twin primes
15. Heuristically Sifting Twins10.1007/s12045-023-1687-0 ↗
16. Small differences between prime numbers
17. On Bombieri and Davenport’s theorem concerning small gaps between primes10.1112/S0025579300006793 ↗
18. Some problems of ‘Partitio Numerorum’ III: On the expression of a number as a sum of primes10.1007/BF02403921 ↗
19. The difference between consecutive prime numbers. II10.1017/S0305004100017291 ↗
20. La série 1/5 + 1/7 + 1/11 + 1/13 + 1/17 + 1/19 + 1/29 + 1/31 + 1/41 + 1/43 + 1/59 + 1/61 + …, où les dénominateurs sont ‘nombres premieres jumeaux’ est convergente ou finie
21. Abd-Elnaby, M., and El-Baz, D. (2021). Development of the Sieve of Eratosthenes and Proof of the Sieve of Sundaram. arXiv.
22. Das, A., and Madhavan, C.E.V. (1999). Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. Lecture Notes in Computer Science, Proceedings of the Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai, India, 16–18 December 1999 Proceedings 10, Springer.
23. Prime sieves using binary quadratic forms10.1090/S0025-5718-03-01501-1 ↗
24. Hartman, S., and Sorenson, J.P. (2024). Reducing the Space Used by the Sieve of Eratosthenes When Factoring. arXiv.10.2139/ssrn.4879475 ↗
25. PRIMES is in P10.4007/annals.2004.160.781 ↗