Formulating an Odd Perfect Number: An in Depth Case Study

A perfect number is a positive integer that is equals to the sum of its proper divisors. No one has ever found an odd perfect number in the field of Number Theory. This paper review discussed the history and the origin of Odd Perfect Numbers. The theorems and proofs are given and stated. This paper states the necessary conditions for the existence of odd perfect numbers. In addition, several related studies such as “Odd Near-Perfect Numbers” and “Deficient-Perfect Numbers”. Formulating odd perfect numbers will have a significant contribution to other Mathematics conjectures. This paper compiles all the known information about the existence of an odd perfect number It also lists and explains the necessary theorems and lemmas needed for the study. The results and conclusions shows the ff: Odd Perfect Numbers has a lower bound of 1


Introduction
Perfect numbers have a rich history. A lot of mathematicians show interest in this topic. They were able to discover the first set of perfect numbers. According to Wikipedia, in an article entitled "Perfect Number", in about 300 BC, Euclid showed that if 2 p −1 is prime then (2 p −1)2 p−1 is perfect. The first four perfect numbers were the only early discoveries of the Greek mathematicians. These numbers are 6, 28, 496, and 8128. [1] Ismail ibnFallūs (1252), mentioned the next three perfect numbers which are 33,550,336, 8,589,869,056 and 137,438,691,328. In a manuscript written between 1456 and 1461, an unknown mathematician recorded the earliest European reference to a fifth perfect number, with 33,550,336 being correctly identified for the first time. [2] Pietro Cataldi (1588), also identified the sixth (8,589,869,056) and the seventh (137,438,691,328) perfect numbers, and also proved that every perfect number obtained from Euclid's rule ends with a 6 or an 8. Where 2 p -1 is prime where p is also prime, it is said to be a Mersenne prime. Mersenne primes are connected to Perfect Numbers because all Perfect Numbers has a factor in the form of 2 p −1. [3] Hence, every Mersenne prime will correspond to one perfect number. It was obvious to Mersenne's peers that he could not have tested all of these numbers, but they could not test them either. It was not until over 100 years later, in 1750, that Euler verified the next number on Mersenne's and Regius' lists, 2 31 -1, was prime. [4] Lucas (1876), verified 2 127 -1 was also prime. Seven years later Pervouchine showed 2 61 -1 was prime, so Mersenne had missed this one. In the early 1900's Powers showed that Mersenne had also missed the primes 289−1 and 2107−1. [5] Finally, by 1947 Mersenne's range, n < 258, is completely checked and it was determined that the correct list is: =2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127. [6] The existence of an odd perfect number remains a big mystery in the field of number theory. The relevance of the existence of odd perfect number will have a great significant contribution to solve some unsolved to other math conjectures such as Pythagorean triples twin primes, and etc. [7]There are currently 49 Mersenne primes known to exist, and, therefore, 49 even perfect numbers have been discovered. The question is whether or not odd perfect numbers exist. There have been no discoveries of odd perfect numbers, although many people have been working on this problem for centuries. There have been many studies leading to a new necessary condition, or limitations, for an odd perfect number to exist. Thus this is the main purpose of this paper: to detail all of the necessary conditions for odd perfect numbers, in order to facilitate the further study of the subject. The largest perfect number is 2 74207280 (2 74207281 -1) [8]

Objective of the Study
The study was designed to determine odd perfect number. This study specifically aimed to review the necessary conditions on the existence of an odd perfect number by: a Lower Bound for Odd Perfect Numbers b Perfect Numbers and Prime Divisors c Largest Prime Factor d On Odd Near-Perfect and Deficient-Perfect Numbers

Methodology
A review article or review paper is based on other published articles. It does not report original research. Review articles generally summarize the existing literature on a topic in an attempt to explain the current state of understanding on the topic. Review papers form valuable scientific literature as they summarize the findings of existing literature. It forms an idea about the existing knowledge. [9] The purpose of a review paper is to succinctly review recent progress in a particular topic. Overall, the paper summarizes the current state of knowledge of the topic. It creates an understanding of the topic for the reader by discussing the findings presented in recent research papers.
A review paper is not a "term paper" or book report. It is not merely a report on some references you found. Instead, a review paper synthesizes the results from several primary literature papers to produce a coherent argument about a topic or focused description of a field. [10] Qualitative research is a market research method that focuses on obtaining data through open-ended and conversational communication. This method is not only about "what" people think but also "why" they think so. The qualitative research method allows for an in-depth and further probing and questioning of respondents based on their responses, where the interviewer/researcher also tries to understand their motivation and feelings. [11] Ethical protocol was observed as stipulated in the university research manual. Most authors who discuss qualitative research design address the importance of ethical considerations.

Framework
The forgoing theoretical concepts are illustrated in the paradigm that follows using the input -process -output scheme. Input is something from the external environment that is fed into the system. In an information system, the inputs may be raw data "captured" in some way or preexisting data, which has been provided by an external system.ν In either case, the data input is provided by an external entity. The transformation process is the most important element of a system. Without output, a system has no link back into its external environment. Output of an information system may be reports generated by an information system, or a picture on a computer monitor, or even data that is fed into another external system. - [12] INPUT, shows the different concepts necessary in studying odd perfect numbers such as even perfect numbers, Mersenne primes, od-near-perfect and deficient-perfect numbers, and prime divisors.
PROCESS, which deals with the ways and methods to make a paper review. A narrative review explains the existing knowledge on a topic based on all the published research available on the topic. A systematic review searches for the answer to a particular question in the existing scientific literature on a topic. A meta-analysis compares and combines the findings of previously published studies, usually to assess the effectiveness of an intervention or mode of treatment. Comparing and relating related studies, as well as, collecting all theorems and facts about odd perfect numbers will be the processes in producing the desired output.
OUTPUT, which is the result of the outcomes of the input and process at is believed that studying and relating these concepts and theorems will lead to know the importance of an odd perfect number, and the necessary conditions for its existence.

Result and Discussion
Odd Perfect Numbers are positive integers that are odd and perfect at the same time. Odd Perfect Numbers are a positive integer that in the form 2k+1 for k is any positive integer, and are equal to the sum of their proper divisors. Many mathematicians tried to prove or disprove the existence of an odd perfect number but so far no one has succeeded. But they were able to collect and gather the necessary conditions on the existence of an odd perfect number. They were able to classify three conditions which are the "Lower Bound for Odd Perfect Numbers", "The Number of Prime Divisors", and "The Largest Prime Factors" [13]. The following are the necessary conditions:

Lower Bound
One condition is the Lower Bound. This condition refers to the minimum value of an Odd Perfect Number. According to Ben Stevens on his paper entitled "A Study on Necessary Conditions for Odd Perfect Numbers". Theorem 4.1 by Ochem and Rao: An odd perfect number is greater than 10 1500 .
Use factor chains to forbid the factors in S = {127, 19, 7, 11,331, 31, 97, 61, 13, 398581, 1093, 3, 5, 307, 17}, in this order. These chains are constructed using branchings. To branch on a prime p means that we sequentially branch on all possible components pa. To branch on a component pa for p prime means that we suppose pa k N, and thus pa × _(pa) | 2N since gcd(pa, _(pa)) = 1. Then, if we do not reach a contradiction at this point, we recursively branch on a prime factor of N that has not yet been branched on. If there is no known other factor of N. In this section, we branch on the overall largest available prime factor and use the following contradictions: (1) The abundancy of the current number is strictly greater than 2.
(2) The current number is greater than 101500. When branching on a prime p, we have to consider various cases depending on the multiplicity of p in N. We stop when the multiplicity a of p is such that pa > 101500, we consider only the multiplicities such that a + 1 is prime. This is because _ (pa) | _ p(a+1)t−1_, so any contradiction obtained thanks to the factors of _ (pa) when supposing pa k N also gives a contradiction in the case p(a+1)t−1 k N. So pa is a representative for all p(a+1)t−1, and to compute lower bounds on the abundancy or the size to test for contradictions, suppose that the multiplicity of p is exactly a.

Perfect Numbers and Prime Divisors
In number theory, the prime factors or divisors of a positive integer are the prime numbers that divide that integer exactly. Mathematicians discover this useful for finding an Odd Perfect Number. Theorem 4.2 by Ochem and Rao: The total number of prime factors of an odd perfect number is at least 101.

Largest Prime Factor
According to Ben Stevens on his paper entitled "A Study on Necessary Conditions for Odd Perfect Numbers", Goto upon using an algorithm, show that 10 8 is an appropriate lower bound for the largest prime factor of an odd perfect number. Lannucci on the other hand, shows that the second large stand third largest prime divisors must exceed 10000 and 100 respectively. [13] Theorem 4.3 by Goto (2008): The largest component of an odd perfect number is greater than 108.
We use the same algorithm as in the previous section to forbid every prime less than 108 using the following contradictions: (1) The abundancy of the current number is strictly greater than 2.
(2) The current number has a component greater than 1062 To quickly reach a large component, we branch on the largest available prime. There is no unfactored composite here, and thus, no roadblock, since every number is less than 1062 and thus has been easily factored. Suppose now that N is an odd perfect number with no prime factor less than 108 and no component pe> 1062. First, the exponent e of any prime factor pis less than 8, since otherwise pe> (108)8 > 1062. The exponent of the special prime p1 is thus 1, because 3 | _(p5) and 3 ∤ N. So N has a prime de Composition N = p1Qn2i=1 p2i,2Qn4i=1 p4i,4Qn6i=1 p6i,6.
Let n2, 2 be the number of primes pi, 2 such that _(p2, 2) = q × r where q < r, qand r primes. Let n2,3 be the number of primes pi,2 such that _(p2i, 2) factors into at least three not necessarily distinct primes.

On Odd Near-Perfect and Deficient -Perfect Numbers
Positive integer n a near-perfect number, if it is sum of all its proper divisors, except one of them. An Odd Near-Perfect Number is a number that is odd and near perfect at the same time. Let ό(n) denote the sum of the divisors of n. We say that n is a Deficient-Perfect Number if ό(n)< 2n. [14] Theorem 3.4.1 BY Adajar, C. I There are finitely many odd near-perfect integers with exactly k prime divisors.
II There are finitely many odd deficient -perfect integers with exactly k prime divisors.

Necessary Conditions for Odd Perfect Numbers
A perfect number is a natural number (an integer greater than zero), whose sigma function equals twice thenumber itself, i.e. σ(N)=2N. The sigma function is the sum of all divisors. As an example, 6 is a perfect number. This is due to σ(6)=1 2; this is because 1+2+3+6=12. The existence of even p: erfect numbers is easily documented, as shown above. Euclid proved that there is a one-to-one correspondence between even perfect numbers and Mersenne primes (a prime being of the form 2p-1, where p is also prime). An even perfect number will always be of the form (2p-1) 2p-1. The proof is as follows. [15] Theorem 3.5.1 by Stevens, Ben Let n be a positive integer. Then, n is an even perfect numberiff n = 2p-1(2p-1) where 2p-1 isprime (which implies p is prime, by Mersenne).

Conclusion
The following conclusions were derived from the outcome of the study: (1) Lower Bound for Odd Perfect Numbers has a lower bound of 10 1500 . This is the latest known information on the lower bound of odd perfect numbers. - (2) Perfect numbers and prime divisors according to Ben Stevens on his paper entitled "A Study on Necessary Conditions for Odd Perfect Numbers", studies have shown that in order for an odd perfect number to exist, there has to be a minimum number of prime divisors. The total number of prime factors/divisors of an odd perfect number is at least 101. (3) Largest Prime Factor is any of the prime numbers that can be multiplied to give the original number. Mathematicians discovered that they can use this in studying Odd Perfect Numbers. Goto upon using an algorithm, show that 10 8 is an appropriate lower bound for the largest prime factor of an odd perfect number. Lannucci on the other hand, shows that the second large stand third largest prime divisors must exceed 10000 and100 respectively. -(4) On Odd Near-Perfect and Deficient-Perfect Numbers The existence of an odd perfect number remains a big mystery in the field of number theory. The existence of an odd perfect numbers is important due to the fact that it will help to solve some unsolved math conjecture. (5) Using the four inputs used, it was proved that the existence of an odd perfect number is possible, provided that the necessary conditions are met.