Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$, we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $(k-1)4^{r^3}$. doi:10.1017/S000497271100246
If N is an odd perfect number with k distinct prime factors then we show that N < 2^(4k) . If some o...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
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...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
Abstract. A 1913 theorem of Dickson asserts that for each fixed natural number k, there are only fin...
If N is an odd perfect number with k distinct prime factors then we show that N < 2^(4k) . If some o...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
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...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
For $k\geq 2$ and $r\geq 1$, we prove that the number of odd $k$-perfect numbers with $r$ distinct p...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this Paper, we show that f...
Abstract. A 1913 theorem of Dickson asserts that for each fixed natural number k, there are only fin...
If N is an odd perfect number with k distinct prime factors then we show that N < 2^(4k) . If some o...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
A natural number \(n\) is called \(k\)-perfect if \(\sigma(n) = kn\). In this note, we show that fo...
Add to ORKG