olymmath

Putnam 2006 B3

  • Session B

Let SS be a finite set of points in the plane. A linear partition of SS is an unordered pair {A,B}\{A,B\} of subsets of SS such that A∪B=SA \cup B = S, A∩B=∅A \cap B = \emptyset, and AA and BB lie on opposite sides of some straight line disjoint from SS (AA or BB may be empty). Let LSL_S be the number of linear partitions of SS. For each positive integer nn, find the maximum of LSL_S over all sets SS of nn points.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2006/b3 · Tag PA75T7PEPJ · Edit this page on GitHub · Keys: j next, k previous