Description
In this paper, we study the prime factorizations of numbers slightly larger than the factorial function. While these are closely related to the factorial prime, they have more inherent structure, which allows for explicit results as of yet not established on factorial prime. Case in point, the main result of this paper is that these numbers, which are described in concrete terms below, cannot be prime powers outside of a handful of small cases; this is a generalization of a classical result stating they cannot be primes. Minor explicit results and heuristic analysis are then given to further characterize the set.
Download count: 1
Details
Title
- Almost-Primes Near Factorials
Contributors
- Lawson, Liam John (Author)
- Jones, John (Thesis director)
- Childress, Nancy (Committee member)
- School of Mathematical and Statistical Sciences (Contributor)
- Barrett, The Honors College (Contributor)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2019-12
Subjects
Resource Type
Collections this item is in