arXiv · 2601.17832
Computing bounded solutions to linear Diophantine equations with the sum of divisors
Abstract
We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath computer algebra system within the framework of recursively enumerated sets and natively benefits from MapReduce parallelization. We used it to discover new solutions to many published equations and close gaps in between the known large solutions, including but not limited to hyperperfect and $f$-perfect numbers, as well as to significantly lift the existence bounds in open questions about quasiperfect and almost-perfect numbers.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Max A. Alekseyev. 2026-01-25. Computing bounded solutions to linear Diophantine equations with the sum of divisors. https://arxiv.org/abs/2601.17832
Cite the original work for its findings. Save a collection to share your selection of sources.