Abstract: This paper deals with the relatively simple problem of determining the decomposition of a reciprocal into the sum or difference of two reciprocals, and of establishing how many such decompositions exist. First, we demonstrate the method on four illustrative cases. We then show that, for a positive integer n, the number of decompositions of 1/n into the sum or difference of two reciprocals is determined by the number of divisors of n2. Afterwards, we illustrate the process of finding decompositions for a specific positive integer. Next, we present the results for an arbitrary positive integer and derive the corresponding explicit formulas. Finally, we present a program created in the computer algebra system Maple 2025 for determining the decompositions for any positive integer, and verify the theoretical results for the previously considered example.
Keywords: reciprocal, Egyptian fraction, greedy algorithm, Erdős–Straus conjecture, prime factorization, Simon’s Favorite Factoring Trick, Diophantine equation, divisor function, computer algebra system Maple 2025
Cite this paper
Potůček R.. (2025) On the Decompositions of a Reciprocal Into the Sum and the Difference of Two Reciprocals. International Journal of Mathematical and Computational Methods, 10 , 231-239

Copyright © 2025 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution License 4.0


