Finding prime desert N-tuplets
Date of Publication
1994
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
Although the number of primes is infinite, one can still find as many consecutive integers as one pleases. This study concerns itself with sets of consecutive integers. Regions of n consecutive composite integers where no prime is present are called prime desert n-tuplets. In order for a prime desert of length k to exist, k must be odd. The existence of prime desert twins and triplets of length k implies that k = 5(mod 6). Moreover, for prime desert quadruplets and quintuplets of length k to exist, k = 29(mod 30). This paper also provides a computer program which will generate all possible prime desert n-tuplets. However, the language is up to maximum value of 2,147,483,647.
Abstract Format
html
Language
English
Format
Accession Number
TU06648
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
57 leaves
Keywords
Numbers, Prime; Numbers, Theory of; Programming (Mathematics); Prime numbers
Recommended Citation
Candoleta, H. H., & Muhi, L. T. (1994). Finding prime desert N-tuplets. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16166
