Pith. sign in

REVIEW 1 cited by

On the number of total prime factors of an odd perfect number

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.13063 v3 pith:ULDJ5D7F submitted 2018-10-31 math.NT

classification math.NT
keywords omeganumberprimefactorsfracboundsestablishfactor
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $N$ be an odd perfect number. Let $\omega(N)$ be the number of distinct prime factors of $N$ and let $\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \frac{302}{113}\omega - \frac{286}{113} \leq \Omega. $ If $3|N$, then $\frac{66}{25}\omega-5\leq\Omega.$ This is an improvement on similar prior results by the author which was an improvement of a result of Ochem and Rao. We also establish new lower bounds on $\omega(N)$ in terms of the smallest prime factor of $N$ and establish new lower bounds on $N$ in terms of its smallest prime factor.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Certified Minimal-Prime Branch Closures for Odd Perfect Numbers

    math.GM 2026-07 conditional novelty 6.5 of 10

    Relative to frozen certificate release C-small-2026-07, no odd perfect number has minimal prime divisor in {5,7,11,13,17}.

Pith tools