scholarly journals On The Theory Of Perfect Numbers and Primes

2021 ◽  
Author(s):  
Alex Nguhi

This paper explores the properties of the set $\frac{n(n+1)}{2}$ and its implication on the distribution of perfect numbers. A major takeaway is a conjecture that all perfect numbers - even and odd lie on that line. It also describes primes arising from the perfect number line equation and equivalent statements of perfectness.

2009 ◽  
Vol 93 (528) ◽  
pp. 404-409
Author(s):  
Peter Shiu

A perfect number is a number which is the sum of all its divisors except itself, the smallest such number being 6. By results due to Euclid and Euler, all the even perfect numbers are of the form 2P-1(2p - 1) where p and 2p - 1 are primes; the latter one is called a Mersenne prime. Whether there are infinitely many Mersenne primes is a notoriously difficult problem, as is the problem of whether there is an odd perfect number.


1975 ◽  
Vol 18 (1) ◽  
pp. 115-122 ◽  
Author(s):  
Charles R. Wall

A divisor d of a positive integer n is a unitary divisor if d and n/d are relatively prime. An integer is said to be unitary perfect if it equals the sum of its proper unitary divisors. Subbarao and Warren [2] gave the first four unitary perfect numbers: 6, 60, 90 and 87360. In 1969,1 reported [3] thatis also unitary perfect. The purpose of this paper is to show that this last number, which for brevity we denote by W, is indeed the next unitary perfect number after 87360.


2012 ◽  
Vol 08 (06) ◽  
pp. 1537-1540 ◽  
Author(s):  
PETER ACQUAAH ◽  
SERGEI KONYAGIN

We prove that a prime factor q of an odd perfect number x satisfies the inequality q < (3x)1/3.


1986 ◽  
Vol 9 (1) ◽  
pp. 205-206 ◽  
Author(s):  
Syed Asadulla

The following results concerning even perfect numbers and their divisors are proved: (1) A positive integernof the form2p−1(2p−1), where2p−1is prime, is a perfect number; (2) every even perfect number is a triangular number; (3)τ(n)=2p, whereτ(n)is the number of positive divisors ofn; (4) the product of the positive divisors ofnisnp; and (5) the sum of the reciprocals of the positive divisors ofnis2. Values ofpfor which 30 even perfect numbers have been found so far are also given.


1965 ◽  
Vol 58 (7) ◽  
pp. 621-622
Author(s):  
Kenneth Hanawalt

A neat proof of an interesting property of perfect numbers


1998 ◽  
Vol 48 (1) ◽  
pp. 187-194 ◽  
Author(s):  
J. L. Lightfoot

Euphorion SH 417 (fr. 36 Van Groningen) deserves to be better known. A curiosity in itself—an apparent poetic reference to number theory—it is also, potentially, one of our earliest references to Euclidean material. On the authority of a late commentator on Aristotle, Euphorion, a mid-third-century b.c. Euboean poet who was also active in Athens and Antioch, is said to have mentioned perfect numbers—i.e. numbers which equal the total of all their factors, including 1 (but obviously excluding the number itself). It is a pity that the context in Euphorion does not survive, and that the line is only preserved, and indeed interpreted, by so late a source. But the wording of the fragment—if Westerink's restoration of its various corruptions (again, a pity) is plausible—would strongly suggest a reference to the notion of perfect number. The fragment has been known since Westerink published it in 1960, and was included both in Van Groningen's edition of Euphorion in 1977 and in Supplementum Hellenisticum (1983). But its implications have still not been discussed, and when David Fowler came to gather the evidence for references to Euclidean material in and after the third century b.c. in The Mathematics of Plato's Academy, his attention, unsurprisingly, was not drawn to it. Euphorion has had a bad press, as a poet of rebarbatively obscure myth and intractable vocabulary; yet he holds some interest, and we may be missing more insights into the intellectual life of the Hellenistic period which the perverse intelligence and baneful wit of the fragments display.


2020 ◽  
Vol 3 (1) ◽  
pp. 15
Author(s):  
Leomarich F Casinillo

<p>Mersenne primes are specific type of prime numbers that can be derived using the formula <img title="\large M_p=2^{p}-1" src="https://latex.codecogs.com/gif.latex?\large&amp;space;M_p=2^{p}-1" alt="" />, where <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" /> is a prime number. A perfect number is a positive integer of the form <img title="\large P(p)=2^{p-1}(2^{p}-1)" src="https://latex.codecogs.com/gif.latex?\large&amp;space;P(p)=2^{p-1}(2^{p}-1)" alt="" /> where <img title="\large 2^{p}-1" src="https://latex.codecogs.com/gif.latex?\large&amp;space;2^{p}-1" alt="" /> is prime and <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" /> is a Mersenne prime, and that can be written as the sum of its proper divisor, that is, a number that is half the sum of all of its positive divisor. In this note, some concepts relating to Mersenne primes and perfect numbers were revisited. Further, Mersenne primes and perfect numbers were evaluated using triangular numbers. This note also discussed how to partition perfect numbers into odd cubes for odd prime <img title="\large p" src="https://latex.codecogs.com/gif.latex?\large&amp;space;p" alt="" />. Also, the formula that partition perfect numbers in terms of its proper divisors were constructed and determine the number of primes in the partition and discuss some concepts. The results of this study is useful to better understand the mathematical structure of Mersenne primes and perfect numbers.</p>


2014 ◽  
Vol 11 (01) ◽  
pp. 159-169
Author(s):  
Tianxin Cai ◽  
Deyi Chen ◽  
Yong Zhang

In this paper, we introduce the concept of F-perfect number, which is a positive integer n such that ∑d|n,d<n d2 = 3n. We prove that all the F-perfect numbers are of the form n = F2k-1 F2k+1, where both F2k-1 and F2k+1 are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers.


1994 ◽  
Vol 115 (2) ◽  
pp. 191-196 ◽  
Author(s):  
D. R. Heath-Brown

It is not known whether or not odd perfect numbers can exist. However it is known that there is no such number below 10300 (see Brent[1]). Moreover it has been proved by Hagis[4]and Chein[2] independently that an odd perfect number must have at least 8 prime factors. In fact results of this latter type can in priniciple be obtained solely by calculation, in view of the result of Pomerance[6] who showed that if N is an odd perfect number with at most k prime factors, thenPomerance's work was preceded by a theorem of Dickson[3]showing that there can be only a finite number of such N. Clearly however the above bound is vastly too large to be of any practical use. The principal object of the present paper is to sharpen the estimate (1). Indeed we shall handle odd ‘multiply perfect’ numbers in general, as did Kanold[5], who extended Dickson's work, and Pomerance. Our result is the following.


Sign in / Sign up

Export Citation Format

Share Document