Orchard-planting problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 February 2025

  • curprev 06:1606:16, 22 February 2025 imported>David Eppstein 6,397 bytes +6,397 Undid revision 1277021043 by 2603:7000:A2F0:6F80:E027:C339:CAF:43DD (talk) you totally missed the point here and garbled the mathematics. There are always AT LEAST n/2 2-point lines and therefore at least n/2 pairs that do not belong to 3-point lines, preventing the 3-point lines from covering all triples