Special Numbers in Number Theory
DOI:
https://doi.org/10.66069/ojspub.1137261011Keywords:
Prime Numbers, Fermat Numbers, Cryptography, Public-key Cryptography, RSA Algorithm, Modular Arithmetic, Primality Testing, Fermat’s Little Theorem, Wilson’s Theorem, Coprimality, Generalized Fermat NumbersAbstract
This paper presents a focused study on two essential categories of numbers in number theory: Prime Numbers and Fermat Numbers. Prime numbers serve as the foundational elements of arithmetic and are widely used in cryptographic systems due to their unique factorization properties. Fermat numbers, defined as Fn = 2^(2^n) + 1, exhibit rare and intriguing mathematical characteristics, including coprimality and applications in polygon construction. While primes are central to both theory and modern encryption, Fermat numbers challenge computational limits in factorization and primality testing. This work explores their properties, theorems, applications, and unresolved questions in mathematical research.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Jyothi Krishna, Sindhu Daniel

This work is licensed under a Creative Commons Attribution 4.0 International License.
Deprecated: json_decode(): Passing null to parameter #1 ($json) of type string is deprecated in /www/bryanhousepub/ojs/plugins/generic/citations/CitationsPlugin.inc.php on line 49