We are discussing the Erdos Strauss conjecture: if $n \geq 2$
\[ \frac{4}{n} = \frac{1}{a} + \frac{1}{b} + \frac{1}{c} \]
has positive integer solutions $a,b,c $
Write code to find all solutions for 4/n. See how the number changes.
Examine what happens for primes. Compare primes and composite n.
|
|