Talk:Best Approximation from Below to 1 as Sum of Minimal Number of Unit Fractions

Note that:

Best approximation as in sum of $4$ unit fractions closest to $1^-$?

Its' infinite version is the greedy Egyptian representation of $1$.

Wells is possibly hinting towards Sylvester's Sequence (is it the same one as the red link on Sylvester's page?):


 * $2, 3, 7, 43, 1807, 3263443, \dots$

recursively defined by
 * $a_1 = 2$, $a_n = 1 + \displaystyle \prod_{1 \mathop \le k \mathop < n} a_k$


 * --RandomUndergrad (talk) 14:22, 18 July 2020 (UTC)


 * Yes, it would be that same "Sylvester's sequence" because I got the list of things named after JJS off his wikipedia page, which is indeed a direct link to that sequence.


 * So I reckon what we can do with this page is either turn it into Definition:Sylvester's Sequence or a page about Definition:Sylvester's Sequence, or something.


 * Feel free to make something sensible about this if you have a good idea of how to craft it. --prime mover (talk) 16:10, 18 July 2020 (UTC)