Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is shown that:o(a)πэα (mod 8) if each prime ukэ1, (mod 4).(b)δ=с(πα)/2 cannot be prime if each prime ukэ3 (mod 4)
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
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...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek...
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...
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 ...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
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...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
AbstractEuler's structure theorem for any odd perfect number is extended to odd multiperfect numbers...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
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...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek...
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...
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 ...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
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...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
AbstractEuler's structure theorem for any odd perfect number is extended to odd multiperfect numbers...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
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...
DOI
Add to ORKG