DOIAbstract
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), is the Euler′s factor of n. It is shown that: if α + 2 is prime or pseudoprime in base π and (α + 2, π − 1) = 1, then M2 ≡ 0 (mod α + 2)
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), is the Euler′s factor of n. It is shown that: if α + 2 is prime or pseudoprime in base π and (α + 2, π − 1) = 1, then M2 ≡ 0 (mod α + 2)
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek...
This article proves that a certain form of odd numbers cannot be perfect, it also provides an altern...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
It has been known since the time of Euler that an odd perfect number N (if it exists) must have the ...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
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...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Abstract. Let σ(n) denote the sum of the positive divisors of n. We say that n is perfect if σ(n) =...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
If N = qkn2 is an odd perfect number, where q is the Euler prime, then we show that n \u3c q is suff...
A slightly alternative proof is presented which establishes a classic result of Euler on odd perfect...
If N = qkn2 is an odd perfect number, where q is the Euler prime, then we show that n \u3c q is suff...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek...
This article proves that a certain form of odd numbers cannot be perfect, it also provides an altern...
AbstractLet n = παM2 be an odd perfect number; πα, with π prime, (π, M) = 1 and π ≡ α ≡ 1 (mod 4), i...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
It has been known since the time of Euler that an odd perfect number N (if it exists) must have the ...
Let n=παΠkuk2bk be an odd perfect number; πα, with πэαэ1, (mod 4), is the Euler's factor. It is show...
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...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Abstract. Let σ(n) denote the sum of the positive divisors of n. We say that n is perfect if σ(n) =...
Leonhard Euler, after proving that every even perfect number has the form given by Euclid, turned hi...
If N = qkn2 is an odd perfect number, where q is the Euler prime, then we show that n \u3c q is suff...
A slightly alternative proof is presented which establishes a classic result of Euler on odd perfect...
If N = qkn2 is an odd perfect number, where q is the Euler prime, then we show that n \u3c q is suff...
We say n ∈ ℕ is perfect if σ (n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No ...
AbstractStarting with Euler's theorem that any odd perfect number n has the form n = pepi2ei … pk2ek...
This article proves that a certain form of odd numbers cannot be perfect, it also provides an altern...
Add to ORKG