Intereting Posts

Dirichlet series
Compute cos(5°) to 5 decimal places with Maclaurin's Series
What is an example of pairwise independent random variables which are not independent?
Determinant of a $2\times 2$ block matrix
Difference between permutation and combination?
liminf in terms of the point-to-set distance
The limit of a sequence $\lim_{n\rightarrow \infty}\prod_{k=0}^{n-1}( 2+\cos \frac{k\pi }{n})^{\pi/n}$.
Without using prime factorization, find a prime factor of $\frac{(3^{41} -1)}{2}$
Are the matrix products $AB$ and $BA$ similar?
Follow-up Question: Proof of Irrationality of $\sqrt{3}$
Why is $S^1 \times S^1$ a Torus?
An easy question on complex
dense in terms of order and in terms of the order topology
If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree?
Computation in Wikipedia's article “Riemann Curvature Tensor”

The Erdős-Straus Conjecture (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:

$$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$

The basic approach to solving this problem outlined by Mordell [Ref1] is described below

- A $\frac{1}{3}$ Conjecture?
- A conjecture concerning primes and algebra
- Conjectures that have been disproved with extremely large counterexamples?
- Is $p(p + 1)$ always a friendly number for $p$ a prime number?
- making mathematical conjectures
- a conjectured continued-fraction for $\displaystyle\cot\left(\frac{z\pi}{4z+2n}\right)$ that leads to a new limit for $\pi$

By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that

a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution

$$\frac{4}{4t}=\frac{1}{t}$$

In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found e.g.

$$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$

b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus

$$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$

will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.

Using Mordell’s approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$

The argument continues…

Mordell goes on to show in turn that the search can be reduced further to the cases when

$$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$

$$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$

$$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$

$$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$

$$n \equiv 1,4 \pmod{5} \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$

Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when

$$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$

Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n<1009$.

This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.

Note that other intermediate results can be constructed from the above congruence’s, e.g. $n \equiv 1 \pmod{24}$.

The question is:

**Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?**

[Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290.

- Integer solutions of $x^4 + 16x^2y^2 + y^4 = z^2$
- When is $8x^2-4$ a square number?
- Find all integers $x$, $y$, and $z$ such that $\frac{1}{x} + \frac{1}{y} = \frac{1}{z}$
- How to show an infinite number of algebraic numbers $\alpha$ and $\beta$ for $_2F_1\left(\frac14,\frac14;\frac34;-\alpha\right)=\beta\,$?
- Prove the inequality for composite numbers
- Solving the equation $ x^2-7y^2=-3 $ over integers
- Examples of falsified (or currently open) longstanding conjectures leading to large bodies of incorrect results.
- Is there $a,b,c,d\in \mathbb N$ so that $a^2+b^2=c^2$, $b^2+c^2=d^2$?
- Disprove the Twin Prime Conjecture for Exotic Primes
- Diophantine equation involving prime numbers : $p^3 - q^5 = (p+q)^2$

For the equation: $$\frac{4}{q}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$$

The solution can be written using the factorization, as follows.

$$p^2-s^2=(p-s)(p+s)=2qL$$

Then the solutions have the form:

$$x=\frac{p(p-s)}{4L-q}$$

$$y=\frac{p(p+s)}{4L-q}$$

$$z=L$$

I usually choose the number $L$ such that the difference: $(4L-q)$ was equal to: $1,2,3,4$ Although your desire you can choose other.

You can write a little differently. If unfold like this:

$$p^2-s^2=(p-s)(p+s)=qL$$

The solutions have the form:

$$x=\frac{2p(p-s)}{4L-q}$$

$$y=\frac{2p(p+s)}{4L-q}$$

$$z=L$$

It was necessary to write the solution in a more General form:

$$\frac{t}{q}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$$

$t,q$ – integers.

Decomposing on the factors as follows: $p^2-s^2=(p-s)(p+s)=2qL$

The solutions have the form:

$$x=\frac{p(p-s)}{tL-q}$$

$$y=\frac{p(p+s)}{tL-q}$$

$$z=L$$

Decomposing on the factors as follows: $p^2-s^2=(p-s)(p+s)=qL$

The solutions have the form:

$$x=\frac{2p(p-s)}{tL-q}$$

$$y=\frac{2p(p+s)}{tL-q}$$

$$z=L$$

When $N$ is pair, then the solution is $$\frac1N + \frac{1}{N/2} + \frac1N = \frac4N.$$

When $N$ is a multiple of $3$, then the solution is $$\frac1{4N} + \frac1{N/3} + \frac1{4N/3} = \frac4N.$$

For the equation.

$$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=\frac{t}{q}$$

All variations of the same formula. As the number of solutions of course need to consider all possible factorization. Too much ends quickly. The number must be greater than 1.

$$z=L$$

$$x=\frac{qL(p+s)}{s(tL-q)}$$

$$y=\frac{qL(p+s)}{p(tL-q)}$$

Consider this example. $t=4$ ; $q=193$

$4L=193+i$

$i=3;7;11…..$

Let $i=7$ Means $L=50$ ; $p=193$ ; $s=10$

$z=50$

$x=1450=50*29$

$y=5*29*193=27985$

- $\epsilon$-$\delta$ proof that $\lim_{x \to 1} \sqrt{x} = 1$
- What are some interesting sole exceptions or counterexamples?
- Prove nth root of n! is less than n+1 th root of ((n+1) !): $\sqrt{n!}\lt \sqrt{(n+1)!}$?
- counting Number of matrices
- Finding Rotation Axis and Angle to Align Two “Oriented Vectors”
- Number of elements in the quotient ring $\mathbb{Z}/(X^2-3, 2X+4)$
- Accuracy of Fermat's Little Theorem?
- The derivative of a function of a variable with respect to a function of the same variable
- How does backwards induction work to prove a property for all naturals?
- Is there a bijective map from $(0,1)$ to $\mathbb{R}$?
- An awful identity
- What is the condition for a field to make the degree of its algebraic closure over it infinite?
- A problem on continuity of a function on irrationals for $f(x) = \sum_{r_n \leq x} 1/n^2$
- Do these matrix rings have non-zero elements that are neither units nor zero divisors?
- Looking for a smooth curve that is not rational