Scholars Central

ArticlePublished 24 Apr 2025

Prime generation via polynomials: Analysis and applications

Authors: Samrat Singh

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

This research offers an extensive analysis of a family of prime-generating polynomials Pk(n)=n2−(2k−79)n+[41+(k−39) (k−40)], designed to generate prime numbers for integer values of n up to k where k ∈ {1, 2, . . . , 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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Pure and Applied Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Pure and Applied Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Samrat Singh”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels