Questions tagged [perfect-numbers]
A perfect number is a positive integer that is equal to the sum of its proper positive divisors.
21 questions
2
votes
1
answer
600
views
A geometric approach to the odd perfect number problem?
Let $e_d$ be the $d$-th standard-basis vector in the Hilbert space $H=l_2(\mathbb{N})$.
Let $h(n) = J_2(n)$ be the second Jordan totient function.
Define:
$$\phi(n) = \frac{1}{n} \sum_{d|n}\sqrt{h(d)}...
9
votes
0
answers
693
views
Van der Pol's identity for the sum of divisors and a quartic polynomial equation for odd perfect numbers
In Touchard (1953) it is mentioned that the sum of divisors $\sigma(n)$ satisfies the following recurrence relation ($n>1$):
$$n^2(n-1) = \frac{6}{\sigma(n)} \sum_{k=1}^{n-1}(3n^2-10k^2)\sigma(k)\...
8
votes
2
answers
718
views
Is there a similar formula like Ramanunjan's Eisenstein series identity for $\sum_{k=1}^{n-1}k^2 \sigma(k)\sigma(n-k)$?
This question is related to the last question about van der Pol's identity for the sum of divisors.
In Touchard (1953) it is mentioned that the sum of divisors $\sigma(n)$ satisfies the following ...
7
votes
1
answer
860
views
Is $n=6$ the only integer satisfies ${\sigma}_x(n) \equiv 0\bmod{n}$ for every odd integer $x > 0$ and $2 (\bmod n)$ if $x$ is even integer? [closed]
After a few computations in wolfram alpha about the divisor function for some values of $n$ to look the behavior of $\sigma_x(n)\bmod n$ for $\,n=6,\,$ i got this result : $\sigma_x(6)=0 \bmod 6$ for $...
6
votes
3
answers
4k
views
Re: Mordell's equation $y^2 = x^3 + k$ and perfect numbers
I have already tried a somewhat exhaustive search of the literature, but couldn't find anything close to the problem that I am working on.
My question is: When does Mordell's equation
$$Y^2 = X^3 + K$$...
4
votes
1
answer
1k
views
On Sorli's Conjecture Re: OPNs (Circa 2003)
In the PhD dissertation titled "Algorithms in the Study of Multiperfect and Odd Perfect Numbers" (hyperlinked here) and completed in 2003, Ronald Sorli conjectured that the exponent $k$ on the Euler ...
2
votes
2
answers
642
views
On the nearest-square function and the quantity $m^2 - p^k$ where $p^k m^2$ is an odd perfect number
This question has been cross-posted from this MSE question and is an offshoot of this other MSE question.
(Note that MSE user mathlove has posted an answer in MSE, which I could not completely ...
2
votes
0
answers
751
views
Does $n \mid \sigma(n^2)$, if $q^k n^2$ is an odd perfect number?
Let $\sigma(x)=\sigma_1(x)$ be the classical sum of divisors of the positive integer $x$.
It is known that
$$\gcd(\sigma(q^k),\sigma(n^2))=\frac{\bigg(\gcd(n,\sigma(n^2))\bigg)^2}{\gcd(n^2,\sigma(n^2))...
2
votes
1
answer
345
views
On odd perfect numbers $q^k n^2$ satisfying $n^2 - q^k = 2^r t$
Let $N = q^k n^2$ be an odd perfect number with special prime $q$, satisfying
$$n^2 - q^k = 2^r t$$
where $r \geq 2$ and $\gcd(2,t)=1$.
We could prove that:
(1) $2^r t > 2n$. (We can modestly ...
1
vote
1
answer
321
views
On odd perfect numbers and a GCD - Part III
Let $m = q^k n^2$ be an odd perfect number with special prime $q$ satisfying $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n)=1$.
It is known that
$$\gcd(\sigma(q^k),\sigma(n^2)) = \frac{(\gcd(n,\sigma(n^...
16
votes
3
answers
1k
views
Perfect numbers and perfect powers
This was asked earlier at MSE.
The observation that 28 = 27 + 1 shows that it is possible to have consecutive perfect numbers and perfect powers. However, this must be extremely rare. Is it ...
8
votes
1
answer
777
views
Can perfect numbers be seen $p$-adically?
It is well known that all even perfect numbers are of the form $N=(2^{q}-1).2^{q-1}$ with $M_{q}:=2^{q}-1$ a Mersenne prime.
As the very defining property of such a perfect number is to fulfill the ...
8
votes
5
answers
1k
views
Generalized quasi-perfect numbers
A number $n \in \mathbb{N}$ is called quasi-perfect if $\sigma(n) = 2n+1$, where $\sigma$ is the sum of divisors function. It is known that if $n$ is quasi-perfect, then it must be the square of an ...
5
votes
0
answers
170
views
Touchard / van der Pol's identity for the sum of divisors and an elliptic curve for perfect numbers
In Touchard (1953) it is mentioned that the sum of divisors $\sigma(n)$, satisifies the following recurrence relation ($n>1$):
$$n^2(n-1) = \frac{6}{\sigma(n)} \sum_{k=1}^{n-1}(3n^2-10k^2)\sigma(k)\...
4
votes
1
answer
335
views
If $N = {q^k}{n^2}$ is an odd perfect number given in Eulerian form, is $n$ a square?
(I have asked a similar question in MSE four days ago, but did not receive any answers. I have therefore cross-posted it to this site, hoping to get some responses.)
An odd perfect number $N$ is ...
3
votes
2
answers
505
views
On odd perfect numbers and a GCD
(Note: This question is closely related to this other one in MSE.)
Let $N = q^k n^2$ be an odd perfect number.
From this paper in NNTDM, we have the equation
$$i(q) := \frac{\sigma(n^2)}{q^k}=\frac{...
3
votes
0
answers
180
views
Does this Theorem 2 from Dandapat et al. imply that $\gcd(\sigma(p^k),\sigma(a^2)) > 1$?
Write the odd perfect number $m=p^k a^2$ as a product of primes
$$m = p^k {p_1}^{2a_1} \cdots {p_v}^{2a_v}.$$
(Note that it is known that $v \geq 9$ by work of Nielsen.) Let $N(m)$ be the number of ...
3
votes
4
answers
1k
views
A conjecture regarding odd perfect numbers
(Note: I asked this question in MSE this June 2018 but did not receive any responses there. I have therefore cross-posted it here, hoping that it gets answered.)
Let $\sigma(z)$ denote the sum of ...
2
votes
1
answer
325
views
Does there exist an integer that is both solitary and almost perfect?
This question is an offshoot from the following MSE post. I hope that it is appropriate for this site.
Let $\sigma(x)$ be the sum of the divisors of $x$.
An integer $a$ is said to be solitary if ...
1
vote
0
answers
167
views
On "Euclidean" odd perfect numbers
In what follows, we let $N = r^s u^2$ be an odd perfect number given in Eulerian form, i.e. $r$ is the special prime satisfying $r \equiv s \equiv 1 \pmod 4$ and $\gcd(r,u)=1$. In this preprint, ...
1
vote
2
answers
387
views
Improving the lower bound $I(n^2) > \frac{2(q-1)}{q}$ when $q^k n^2$ is an odd perfect number
Let $N = q^k n^2$ be an odd perfect number with special prime $q$ satisfying $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n)=1$.
Define the abundancy index
$$I(x)=\frac{\sigma(x)}{x}$$
where $\sigma(x)$ ...