Skip to main content
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Source Link

(Note: This question has been cross-posted to MSEMSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

Question (1) is illustrated (as detailed above) in the case of even perfect numbers, almost perfect numbers which are powers of two, and spoof odd perfect numbers (otherwise known in the literature as Descartes numbers).

Question (2) is illustrated (as detailed above) in the case of even almost perfect numbers which are not powers of two, and odd perfect numbers.

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

Question (1) is illustrated (as detailed above) in the case of even perfect numbers, almost perfect numbers which are powers of two, and spoof odd perfect numbers (otherwise known in the literature as Descartes numbers).

Question (2) is illustrated (as detailed above) in the case of even almost perfect numbers which are not powers of two, and odd perfect numbers.

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

Question (1) is illustrated (as detailed above) in the case of even perfect numbers, almost perfect numbers which are powers of two, and spoof odd perfect numbers (otherwise known in the literature as Descartes numbers).

Question (2) is illustrated (as detailed above) in the case of even almost perfect numbers which are not powers of two, and odd perfect numbers.

added last two paragraphs
Source Link

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

Question (1) is illustrated (as detailed above) in the case of even perfect numbers, almost perfect numbers which are powers of two, and spoof odd perfect numbers (otherwise known in the literature as Descartes numbers).

Question (2) is illustrated (as detailed above) in the case of even almost perfect numbers which are not powers of two, and odd perfect numbers.

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

Question (1) is illustrated (as detailed above) in the case of even perfect numbers, almost perfect numbers which are powers of two, and spoof odd perfect numbers (otherwise known in the literature as Descartes numbers).

Question (2) is illustrated (as detailed above) in the case of even almost perfect numbers which are not powers of two, and odd perfect numbers.

added 23 characters in body
Source Link

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $\gcd(x,y)=1$ and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

(Note: This question has been cross-posted to MSE.)

Let $\sigma(a) = \sigma_{1}(a)$ be the sum of the divisors of the positive integer $a$.

A number $M$ is called almost perfect if $\sigma(M) = 2M - 1$. $N$ is called perfect if $\sigma(N) = 2N$.

$M_s = 2^s$ where $s \geq 0$ are almost perfect, with $M_0 = 1$ being the only odd almost perfect number that is currently known. If $M \neq 2^t$ is an even almost perfect number, then Antalan and Tagle showed that $M$ must have the form $$M = {b^2}{2^r}$$ where $r \geq 1$ and $b$ is an odd composite.

On the other hand, only $49$ even perfect numbers have been discovered, and they are of the form $$N_e = 2^{p-1}\left(2^p - 1\right)$$ where $2^p - 1$ and $p$ are primes. It is currently unknown whether there are any odd perfect numbers, but Euler showed that they are of the form $$N_o = n^2 q^c$$ where $q$ is prime with $q \equiv c \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$.

Notice the following:

For numbers that we know exist

Even Perfect Numbers

Assuming $N_e \neq 6$ (because it is squarefree), $$\dfrac{\sigma(2^{(p-1)/2})}{2^p - 1} = \dfrac{2^{(p+1)/2} - 1}{2^p - 1}< 1 < 4 \le 2^{(p+1)/2} = \dfrac{\sigma(2^p - 1)}{2^{(p-1)/2}}.$$

Note that $$\dfrac{\sigma(2^p - 1)}{2^p - 1} \leq \dfrac{8}{7} < \sqrt{\dfrac{7}{4}} < \dfrac{\sigma(2^{(p-1)/2})}{2^{(p-1)/2}}.$$

Almost Perfect Numbers (Powers of Two)

Since $s \geq 0$, $$\dfrac{\sigma(\sqrt{1})}{2^s} \leq 1 \leq 2^{s+1} - 1 = \dfrac{\sigma(2^s)}{\sqrt{1}}.$$

Note that $$\dfrac{\sigma(\sqrt{1})}{\sqrt{1}} = 1 \leq \dfrac{\sigma(2^s)}{2^s}.$$

Spoof Odd Perfect Numbers

In Descartes' example $D = km$, we have $$m = 22021 = {{19}^2}\cdot{61}$$ and $$\sqrt{k} = {3}\cdot{7}\cdot{11}\cdot{13}.$$

Note that $$\dfrac{\sigma(\sqrt{k})}{m} = \dfrac{5376}{22021} < 1 < \dfrac{22022}{3003} < \dfrac{m+1}{\sqrt{k}}$$ and $$\dfrac{m+1}{m} = \dfrac{22022}{22021} < \dfrac{5376}{3003} = \dfrac{\sigma(\sqrt{k})}{\sqrt{k}}.$$

For numbers that are conjectured not to exist

Even Almost Perfect Numbers (Other Than Powers of Two)

$$\dfrac{\sigma(2^r)}{b} < 1 < 2 < \dfrac{\sigma(b)}{2^r}$$

Note that $$\dfrac{\sigma(b)}{b} < \dfrac{4}{3} < \dfrac{3}{2} \leq \dfrac{\sigma(2^r)}{2^r}.$$ "Some New Results On Even Almost Perfect Numbers Which Are Not Powers Of Two" - Theorem 2.2, page 5

Odd Perfect Numbers

The following inequalities are conjectured in New Results for Sorli's Conjecture on Odd Perfect Numbers - Part II:

$$\dfrac{\sigma(q^c)}{n} < 1 < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{q^c}.$$

Note that $$\dfrac{\sigma(q^c)}{q^c} < \dfrac{5}{4} < \sqrt{\dfrac{8}{5}} < \dfrac{\sigma(n)}{n}.$$

(Added June 27 2016 - In fact, in a recent preprint, Brown claims a partial proof for $q^c < n$, which would be consistent with the conjecture here.)

Here are my questions:

(1) If $K = {x^2}{y^z}$ is a (hypothetical) number satisfying $\sigma(K) = 2K + \alpha$ (with $y$ prime, $\gcd(x,y)=1$, and where $\alpha$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(x)}{y^z} \leq 1 \leq \dfrac{\sigma(y^z)}{x}$$ seem to guarantee existence of such numbers $K$?

(2) If $L = {u^2}{v^w}$ is a (hypothetical) number satisfying $\sigma(L) = 2L + \beta$ (with $v$ prime, $\gcd(u,v)=1$ and where $\beta$ could be zero or negative), might there be a specific reason why the inequalities $$\dfrac{\sigma(v^w)}{u} < 1 < \dfrac{\sigma(u)}{v^w}$$ seem to predict nonexistence of such numbers $L$?

added 6 characters in body
Source Link
Loading
Post Closed as "Needs details or clarity" by Steven Landsburg, Stefan Kohl, user1688, Jan-Christoph Schlage-Puchta, user1073
edited body
Source Link
Loading
edited body
Source Link
Loading
added number-theoretic equations that the integers $K$ and $L$ must satisfy
Source Link
Loading
edited body
Source Link
Loading
added cross-post hyperlink to MSE
Source Link
Loading
added further inequality estimates of note
Source Link
Loading
changed title to "On the conjectured nonexistence of even almost perfect numbers (other than powers of two) and odd perfect numbers"
Link
Loading
changed the words "predict existence" to "guarantee existence"
Source Link
Loading
added reference to Brown's preprint on a partial proof for $q^k < n$
Source Link
Loading
Source Link
Loading