EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

An Algorithmic Approach to Generating and Classifying Pseudoprimes

Shubham Agarwal, Sanju Kumar Singh, Deepak Kumar Sharma, Bhawana Fulara, Vinod Jangid, Ambika Sharma, Suchita Dwivedi

Journal of Business Management and Information Systems · 30.06.2026 · 13 (1) · 45-54

DOI: 10.48001/jbmis.1301004 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Business Management and Information Systems, online erschienen am 30.06.2026. Verfasst von Shubham Agarwal und 6 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Pseudoprimes occupy an important position in computational number theory because they demonstrate the limitations of elementary primality tests and provide a framework for studying the relationship between algebraic properties and computational algorithms. A pseudoprime is a composite integer that satisfies a condition associated with primality for one or more specified bases. Depending on the test employed, pseudoprimes may be classified as Fermat pseudoprimes, Euler–Jacobi pseudoprimes, or strong pseudoprimes; Carmichael numbers form a special class of composites that satisfy the Fermat congruence for every base relatively prime to the number. This paper develops an algorithmic framework for generating and classifying pseudoprimes within a finite search interval. The framework combines preliminary divisibility checks, modular exponentiation, the Fermat congruence, the Euler–Jacobi criterion, and the strong probable-prime criterion. It also discusses the structural conditions used to identify Carmichael numbers and proposes a classification procedure that records which tests each composite integer satisfies. Mathematical examples illustrate the distinctions among the principal classes. Pseudocode and a reference implementation support reproducibility, while computational complexity is analyzed in terms of the search bound and candidate bit length. The contribution is a unified and reproducible computational workflow rather than a claim of a new primality theorem. The framework supports comparisons among pseudoprime classes and provides a basis for experimental investigation of their finite-range distribution.

Zitieren

APA

Agarwal, S., Singh, S. K., Sharma, D. K., Fulara, B., Jangid, V., Sharma, A., & Dwivedi, S. (2026). An Algorithmic Approach to Generating and Classifying Pseudoprimes. Journal of Business Management and Information Systems, 13(1), 45-54. https://doi.org/10.48001/jbmis.1301004

Vancouver

Agarwal S, Singh SK, Sharma DK, Fulara B, Jangid V, Sharma A, et al. An Algorithmic Approach to Generating and Classifying Pseudoprimes. Journal of Business Management and Information Systems. 2026;13(1):45-54. doi:10.48001/jbmis.1301004

BibTeX
@article{Agarwal2026,
  author = {Agarwal, Shubham and Singh, Sanju Kumar and Sharma, Deepak Kumar and Fulara, Bhawana and Jangid, Vinod and Sharma, Ambika and Dwivedi, Suchita},
  title = {An Algorithmic Approach to Generating and Classifying Pseudoprimes},
  journal = {Journal of Business Management and Information Systems},
  year = {2026},
  volume = {13},
  number = {1},
  pages = {45--54},
  doi = {10.48001/jbmis.1301004}
}
Kostenlos starten →