Joshua Zelinsky

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Weighted Versions of the Arithmetic-Mean-Geometric Mean Inequality and Zaremba's Function
(available as arXiv preprint)
N/APaper
The sum of the reciprocals of the prime divisors of an odd perfect or odd primitive non-deficient number
(available as arXiv preprint)
N/APaper
Must a primitive non-deficient number always have a small component?
Journal of Integer Sequences
2026-08-04Paper
Strongly Pseudoperfect Numbers
(available as arXiv preprint)
2026-01-01Paper
The sum of the reciprocals of the prime divisors of an odd perfect or odd primitive non-deficient number
Integers
2025-08-19Paper
On 2-near perfect numbers
Integers
2025-08-12Paper
Kullback-Leibler divergence and primitive non-deficient numbers
(available as arXiv preprint)
2025-01-01Paper
On near superperfect numbers, the Goormaghtigh conjecture, and Mertens' theorem
(available as arXiv preprint)
2025-01-01Paper
Complete characterization of 2-near perfect numbers with exactly 2 prime factors
(available as arXiv preprint)
2025-01-01Paper
Total difference chromatic numbers of regular infinite graphs
Involve
2024-01-11Paper
Dots and Boxes on Certain Families of Graphs
(available as arXiv preprint)
2024-01-01Paper
A Note on a Result of Makowski2023-10-10Paper
On 2-Near Perfect Numbers2023-10-02Paper
scientific article; zbMATH DE number 7674553 (Why is no real title available?)
(available as arXiv preprint)
2023-04-14Paper
scientific article; zbMATH DE number 7674553 (Why is no real title available?)2023-04-14Paper
A Note on a Result of Makowski
(available as arXiv preprint)
2023-01-01Paper
Upper Bounds on Integer Complexity2022-11-05Paper
On the third largest prime divisor of an odd perfect number
(available as arXiv preprint)
2022-03-24Paper
On the third largest prime divisor of an odd perfect number2022-03-24Paper
Upper Bounds on Integer Complexity
(available as arXiv preprint)
2022-01-01Paper
On the total number of prime factors of an odd perfect number
(available as arXiv preprint)
2021-09-15Paper
On the total number of prime factors of an odd perfect number2021-09-15Paper
Must a primitive non-deficient number have a component not much larger than its radical?2020-05-25Paper
On the small prime factors of a non-deficient number
(available as arXiv preprint)
2020-05-25Paper
Must a primitive non-deficient number have a component not much larger than its radical?
(available as arXiv preprint)
2020-01-01Paper
Upper bounds on the second largest prime factor of an odd perfect number
International Journal of Number Theory
2019-07-04Paper
An improvement of an inequality of Ochem and Rao concerning odd perfect numbers
(available as arXiv preprint)
2019-06-21Paper
An improvement of an inequality of Ochem and Rao concerning odd perfect numbers2019-06-21Paper
Upper bounds for the number of primitive ray class characters with conductor below a given bound
Acta Arithmetica
2016-09-02Paper
Numbers with integer complexity close to the lower bound
Integers
2013-01-17Paper
Numbers with integer complexity close to the lower bound
Integers
2013-01-17Paper
scientific article; zbMATH DE number 1919528 (Why is no real title available?)2003-05-27Paper
scientific article; zbMATH DE number 1919528 (Why is no real title available?)2003-05-27Paper


Research outcomes over time


This page was built for person: Joshua Zelinsky