Orchard Planting Problem/Classic Form/10

From ProofWiki
Jump to navigation Jump to search

Classic Problem

$10$ trees are to be planted in an orchard so as to make the number of rows of $3$ trees the largest number possible.

That is:

$10$ points are to be configured in the plane so that the number of straight lines that can be drawn through exactly $3$ of these points is maximised.


Solution

OrchardPlanting-Classic-10.png

The number of rows is $12$.

$\blacksquare$