Joshua Zelinsky

most citedAn improvement of an inequality of Ochem and Rao concerning odd perfect numbers

2 citations · 2 across the 1 of their papers we have counts for

collaborators

3 papers

math.NT2018

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

Joshua Zelinsky

Let $N$ be an odd perfect number. Let $ω (N)$ be the number of distinct prime factors of $N$ and let $Ω (N)$ be the total number of prime factors of $N$ . We prove that if $(3, N) = 1$ ,…

math.NT2018

Upper bounds on the second largest prime factor of an odd perfect number

Joshua Zelinsky

Acquaah and Konyagin showed that if $N$ is an odd perfect number where $N = p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{k}^{a_{k}}$ where $p_{1} < p_{2} \dots < p_{k}$ then one must have $p_k < 3^{1/3}N^{1…

math.NT2017★ 2 cited

An improvement of an inequality of Ochem and Rao concerning odd perfect numbers

Joshua Zelinsky

Let $Ω (n)$ denote the total number of prime divisors of $n$ (counting multiplicity) and let $ω (n)$ denote the number of distinct prime divisors of $n$ . Various inequalities have be…