olymmath

AUSTRIAN-POLISH 1981 Problem 8

    The plane has been partitioned into NN regions by three bunches of parallel lines. What is the least number of lines needed in order that N>1981N > 1981 ?

    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 austrian-polish/1981/p8 · Tag G1DZHWA01G · Edit this page on GitHub · Keys: j next, k previous