Add to ORKGAbstract. A 1913 theorem of Dickson asserts that for each fixed natural number k, there are only finitely many odd perfect numbers N with at most k distinct prime factors. We show that the number of such N is bounded b
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...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
If N is an odd perfect number with k distinct prime factors then we show that N < 2^(4k) . If some o...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
International audienceBrent, Cohen, and te Riele proved in 1991 that an odd perfect number N is grea...
International audienceBrent, Cohen, and te Riele proved in 1991 that an odd perfect number N is grea...
AbstractIt is not known whether or not there exists an odd perfect number. We describe an algorithmi...
Abstract. Let σ(n) denote the sum of the positive divisors of n. We say that n is perfect if σ(n) =...
The finiteness of the number of solutions to the rationality condition for the existence of odd perf...
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...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any int...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
If N is an odd perfect number with k distinct prime factors then we show that N < 2^(4k) . If some o...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
International audienceBrent, Cohen, and te Riele proved in 1991 that an odd perfect number N is grea...
International audienceBrent, Cohen, and te Riele proved in 1991 that an odd perfect number N is grea...
AbstractIt is not known whether or not there exists an odd perfect number. We describe an algorithmi...
Abstract. Let σ(n) denote the sum of the positive divisors of n. We say that n is perfect if σ(n) =...
The finiteness of the number of solutions to the rationality condition for the existence of odd perf...
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...
An odd perfect number N is a number whose sum of divisors is equal to 2N. Euler proved that if an od...