olymmath

ISL 1990 Problem 33

    Let S be a 1990-element set and P be a set of 100-ary sequences (a1,a2,...,a100)(a_1,a_2,...,a_{100}) ,where ai′sa_i's are distinct elements of S.An ordered pair (x,y) of elements of S is said to appear in (a1,a2,...,a100)(a_1,a_2,...,a_{100}) if x=aix=a_i and y=ajy=a_j for some i,j with 1≤i<j≤1001\leq i<j\leq 100 .Assume that every ordered pair (x,y) of elements of S appears in at most one member in P.Show that ∣P∣≤800|P|\leq 800 .

    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 isl/1990/p33 · Tag EZA0S76J1Q · Edit this page on GitHub · Keys: j next, k previous