On Egyptian fractions

Abstract

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erdos-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long sequence of consecutive numbers satisfying the Erdos-Straus Conjecture. We conjecture that the values of this polynomial include all the prime numbers of the form 4q+5, which is checked up to 1014. A greedy-type algorithm to find an Erdos-Straus decomposition is also given; the convergence of this algorithm is proved for a wide class of numbers. Combining this algorithm with the mentioned polynomial we verify that all the natural numbers n, 2 n 2× 1014, satisfy the Edos-Straus Conjecture.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…