Date of Last Revision

2018-10-11 06:30:57



Degree Name

Bachelor of Science

Date of Expected Graduation

Fall 2018


An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson proved that for an arbitrary positive integer d there exists only finitely many odd primitive abundant numbers having exactly d prime divisors. In this paper we describe a fast algorithm that finds all primitive odd numbers with d unique prime divisors. We use this algorithm to find all the number of odd primitive abundant numbers with 6 unique Divisors. We use this algorithm to prove that an odd weird number must have at least 6 prime divisors.

Research Sponsor

Dr. Jeffrey Riedl

First Reader

Dr. James Cossey

Second Reader

Dr. Stefan Forcey


Finding the exact OPAN(6) Is currently in progress on a server.

Included in

Number Theory Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.