Papers › On solutions of ∑ᵢ₌₁ⁿ 1/xᵢ = 1 in integers of the form 2ᵃ kᵇ
On solutions of ∑ᵢ₌₁ⁿ 1/xᵢ = 1 in integers of the form 2ᵃ kᵇ
Joel Louwsma
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.
We give an algorithm that produces all solutions of the equation ∑ᵢ₌₁ⁿ 1/xᵢ = 1 in integers of the form 2ᵃ kᵇ, where k is a fixed positive integer that is not a power of 2, a is an element of {0,1,2} that can vary from term to term, and b is a nonnegative integer that can vary from term to term. We also completely characterize the pairs (k,n) for which this equation has a nontrivial solution in integers of this form.
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