Best Approximation from Below to 1 as Sum of Minimal Number of Unit Fractions
Jump to navigation
Jump to search
This theorem requires a proof.
It is not clear exactly what is being stated here.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
- $\dfrac 1 2 + \dfrac 1 3 + \dfrac 1 7 + \dfrac 1 {43} = 1 - \dfrac 1 {1806}$
This is the best approximation from below to $1$ as the minimal sum of unit fractions.
Proof
It is not clear exactly what is being stated here.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $43$