Papers › Some Results on Zumkeller Numbers
Some Results on Zumkeller Numbers
Sai Teja Somu, Andrzej Kukla, Duc Van Khanh Tran
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A positive integer n is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers. For any positive integer m, we prove that there are infinitely many positive integers n for which n+1,⋯, n+m are all Zumkeller numbers. Additionally, we show that every positive integer greater than 94185 can be expressed as a sum of two Zumkeller numbers and that all sufficiently large integers can be written as a sum of a Zumkeller number and a practical number. We also show that there are infinitely many positive integers that cannot be expressed as a sum of a Zumkeller number and a square or a prime.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections