olymmath

VTRMC 1980 Problem 7

    Let SS be the set of all ordered pairs of integers (m,n)(m,n) satisfying m>0m>0 and n<0.n<0. Let << be a partial ordering on SS defined by the statement (m,n)<(m′,n′)(m,n)<(m',n') if and only if m≤m′m\le m' and n≤n′.n\le n'. An example is (5,−10)<(8,−2).(5,-10)<(8,-2). Now let OO be a completely ordered subset of S,S, in other words if (a,b)∈O(a,b)\in O and (c,d)∈O,(c,d) \in O, then (a,b)<(c,d)(a,b)<(c,d) or (c,d)<(a,b).(c,d)<(a,b). Also let O′O' denote the collection of all such completely ordered sets.

    (a) Determine whether and arbitrary O∈O′O\in O' is finite. (b) Determine whether the carnality ∣O∣|O| of OO is bounded for O∈O′.O\in O'. (c) Determine whether ∣O∣|O| can be countable infinite for any O∈O′.O\in O'.

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Virginia Tech Regional Mathematics Contest 1980 official paper, page 2.

    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 vtrmc/1980/p7 · Tag 7M613KSM73 · Edit this page on GitHub · Keys: j next, k previous