Proof-verification request: If $q^k n^2$ is an odd perfect number with special prime $q$, then $q < n^{2/5}$.

arithmetic-functionsdivisor-sumperfect numberssolution-verificationupper-lower-bounds

Hereinafter, we will denote the classical sum of divisors of the positive integer $x$ by $\sigma(x)=\sigma_1(x)$.

The topic of odd perfect numbers likely needs no introduction.

Let $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$. We wish to show that $q < n^{2/5}$.

MY ATTEMPT

Suppose to the contrary that $n^{2/5} \leq q$. Note that $n^{2/5} \neq q$ because otherwise we obtain $n^2 = q^5$ which contradicts $\gcd(q,n)=1$. Hence, by assumption, we have
$$n < q^{5/2}.$$

Since $q^k < n^2$ (JIS – Dris, 2012), then note that this implies that
$$q^k < n^2 < q^5$$
$$k < 5,$$
which forces $k=1$ since $k \equiv 1 \pmod 4$.

However, from this answer to a closely related question, we have the inequality
$$1 = k < K < \frac{\log 2}{\log q} + 2\log_q {n} – \frac{\log \rho}{\log q}, \tag{1}$$
where the quantity $\rho$ satisfies
$$\rho < \frac{\sigma(n^2)}{q^k} = \frac{2n^2}{\sigma(q^k)} = \gcd(n^2, \sigma(n^2))$$
(Note that we may take $\rho > 3374$ by this comment.)

We then get the estimate
$$1 < K < \frac{\log 2}{\log q} + 2\log_q {n} – \frac{\log \rho}{\log q} < \frac{\log 2}{\log 5} + 2\log_q {q^{5/2}} – \frac{\log 3374}{\log 5}$$ $$= 5 + \frac{\log 2}{\log 5} – \frac{\log 3374}{\log 5} = \log_5\bigg(\frac{3125}{1687}\bigg) \approx 0.3830421, \tag{2}$$
which is a contradiction. Hence, we conclude that $q < n^{2/5}$.

Here are my:

QUESTIONS: Is this argument logically sound? (In particular, are the estimates in Steps (1) and (2) correct?) If not, how can it be mended so as to produce a valid proof?


Added from this recent comment: Just in case it is not clear – Another way to arrive at the contradiction in Estimate $(2)$ is as follows:
$$K \log q < \log 2 + 2 \log n – \log \rho < \log 2 + 2 \log q^{5/2} – \log 3374$$
$$= \log 2 + 5 \log q – \log 3374 \implies (K – 5) \log q < \log 2 – \log 3374$$
$$\implies (K – 5) \log 5 \leq (K – 5) \log q < \log 2 – \log 3374 \implies K – 5 < \frac{\log 2 – \log 3374}{\log 5}$$
$$\implies K < 5 + \log_{5} 2 – \log_{5} 3374 = \log_{5} \left(\frac{3125}{1687}\right) \approx 0.3830421.$$

(Note that I am using the fact that the logarithm is a monotonically increasing function.)

Best Answer

$$1 < K < \frac{\log 2}{\log q} + 2\log_q {n} - \frac{\log \rho}{\log q} < \frac{\log 2}{\log 5} + 2\log_q {q^{5/2}} - \frac{\log 3374}{\log 5}$$

It seems that you used $- \dfrac{\log \rho}{\log q} < - \dfrac{\log 3374}{\log 5}$, but this does not hold for $\rho=3375$ and $q=13$.


$$K \log q < \log 2 + 2 \log n - \log \rho < \log 2 + 2 \log q^{5/2} - \log 3374$$ $$= \log 2 + 5 \log q - \log 3374 \implies (K - 5) \log q < \log 2 - \log 3374$$ $$\implies (K - 5) \log 5 \leq (K - 5) \log q < \log 2 - \log 3374 $$

Let $F(q):=\dfrac{\log 2+5\log q−\log{3374}}{\log q}$.

Since $F′(q)>0$, we have $K<F(q)<\displaystyle\lim_{q\to\infty}F(q)=5$.

So, $(K−5)\log 5\leqslant (K−5)\log q$ does not hold.