Joshua Zelinsky

activity

20122026

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

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

collaborators

Showing 2026Show all

2 papers · 1 filter

math.NT2026

Strongly Pseudoperfect Numbers

Audrey Wang, Joshua Zelinsky

A positive integer $n$ is said to be strongly pseudoperfect if there is a subset $S$ of the positive divisors of $n$ such that $d \in S$ if and only if $n / d \in S$ , and $\sum_{d \i…

math.GM2026

On odd perfect numbers with exactly one even exponent greater than 2

Pascal Ochem, Joshua Zelinsky

We show that if all the even exponents of an odd perfect number N are equal to 2 except for one, then $3^{23, 000, 000, 000}$ divides N .