An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2

Details An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2 An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2

2009-12-14

arxiv.org/abs/0912.2458v1

Mathematics

General Mathematics

9 pages, no figures

Scientific paper

From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that has come down to us in the last 60 years, is known as the Erdos- Strauss conjecture which states that for each positive integer n>1; the fraction 4/n can be decomposed into a sum of three distinct unit fractions. Since 1950, a numberof partial results have been achieved, see references [1]- [8]; and also [10] and[11]. In this work we contribute four theorems. In Theorem 2, we prove that if the fraction 4/n is not equal to a sum of three distinct unit fractions, then each prime divisor of n; must be congruent to 1 modulo24. Moreover, if n contains a divisor noncongruent to 1mod24; then such a decomposition does exist and it is explicitly given.

Affiliated with

Also associated with

No associations

Rating

An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An ancient Egyptian problem:the diophantine equation 4/n=1/x+1/y+1/z, n>or=2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623881