AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek, where p, p1,…,pk are distinct odd primes and p ≡ e ≡ 1 (mod 4), we show that extensive subsets of these numbers (so described) can be eliminated from consideration. A typical result says: if pe, pi2ei,…,pr2er are all of the prime-power divisors of such an n with p ≡ pi ≡ 1 (mod 4), then the ordered set {e1,…,er} contains an even number or odd number of odd numbers according as e ≡ p or e ≡ p (mod 8)
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abun...
Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abun...
AbstractEuler's structure theorem for any odd perfect number is extended to odd multiperfect numbers...
As shown by Euler an odd perfect number n must be of the form n=p^α m^2 where p≡α≡1 (mod 4) and p is...
As shown by Euler an odd perfect number n must be of the form n=p^α m^2 where p≡α≡1 (mod 4) and p is...
It has been known since the time of Euler that an odd perfect number N (if it exists) must have the ...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma...
A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
AbstractIt is not known whether or not there exists an odd perfect number. We describe an algorithmi...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abun...
Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abun...
AbstractEuler's structure theorem for any odd perfect number is extended to odd multiperfect numbers...
As shown by Euler an odd perfect number n must be of the form n=p^α m^2 where p≡α≡1 (mod 4) and p is...
As shown by Euler an odd perfect number n must be of the form n=p^α m^2 where p≡α≡1 (mod 4) and p is...
It has been known since the time of Euler that an odd perfect number N (if it exists) must have the ...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma...
A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
AbstractIt is not known whether or not there exists an odd perfect number. We describe an algorithmi...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...