olymmath

OME 1999 Problem 6

    A plane is divided into NN regions by three families of parallel lines. No three lines pass through the same point. What is the smallest number of lines needed so that N>1999N > 1999 ?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

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

    Locator es-ome/1999/p6 · Tag V8AQKV84RF · Edit this page on GitHub · Keys: j next, k previous