10 ms·
Where's the 'solved' part? At the very best, he shows that you can do it with 2n-2 lines. Even that includes a lot of hand waving/implicit "it is easy to see"-s
by Someone 14y ago
Where's the 'solved' part? At the very best, he shows that you can do it with 2n-2 lines. Even that includes a lot of hand waving/implicit "it is easy to see"-s.
That you need 2n-2 lines, he doesn't talk about at all.
- danbruc 14y agoAdditionally the OEIS now contains a wrong fact [1] - the sequences are offset by one. I am not even convinced that 2n - 2 is optimal - does somebody know if it is or can proof a better lower bound than the trivial n? [1] http://oeis.org/A058992 http://oeis.org/A058992