Keywords
prime divisor, primitive divisor, recurrence sequence, marsenne prime, polynomial sequence
Abstract
We examine results concerning the generation of primes in certain types of integer sequences. The sequences discussed all have a connection in that each satisfies a recurrence relation. Mathematicians have speculated over many centuries that these sequences contain an infinite number of prime terms, however no proof has been given as such. We examine a less direct method of showing an infinitude of primes in each sequence by showing that the sequences contain an infinite number of terms with primitive divisors.
Notes
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Graduation Date
2006
Semester
Spring
Advisor
Mohapatra, Ram N.
Degree
Master of Science (M.S.)
College
College of Arts and Sciences
Department
Mathematics
Degree Program
Mathematics
Format
application/pdf
Identifier
CFE0001013
URL
http://purl.fcla.edu/fcla/etd/CFE0001013
Language
English
Length of Campus-only Access
None
Access Status
Masters Thesis (Open Access)
STARS Citation
Russell, Richard, "On Prime Generation Through Primitive Divisors Of Recurrence Sequences" (2006). Electronic Theses and Dissertations. 879.
https://stars.library.ucf.edu/etd/879