Article
Version 1
This version is not peer-reviewed
Prime Generation via Polynomials: Analysis and Applications
Version 1
: Received: 1 November 2024 / Approved: 1 November 2024 / Online: 4 November 2024 (09:01:36 CET)
How to cite: Singh, S. Prime Generation via Polynomials: Analysis and Applications. Preprints 2024, 2024110123. https://doi.org/10.20944/preprints202411.0123.v1 Singh, S. Prime Generation via Polynomials: Analysis and Applications. Preprints 2024, 2024110123. https://doi.org/10.20944/preprints202411.0123.v1
Abstract
This research offers an extensive analysis of a family of prime-generating polynomials \( P_k(n) = n^2 - (2k - 79)n + [41 + (k - 39)(k - 40)] \), designed to generate prime numbers for integer values of \( n \) up to \( k \) where \( k \in \{1, 2, \ldots, 80\} \). We elaborate on mathematical clarity, consistency in proofs, error bounds, prime repetition analysis, and cryptographic implications. This study provides in-depth inductive proofs, graphical error bounds analysis, prime repetition statistics, and cryptographic security assessments, offering novel insights and future directions for research in number theory and secure prime generation.
Keywords
primes; polynomials; prime-generation; cryptography
Subject
Computer Science and Mathematics, Algebra and Number Theory
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment