olymmath

VMO 2020 Problem 7

    Given a positive integer n>1n>1 . Denote TT a set that contains all ordered sets (x;y;z)(x;y;z) such that x,y,zx,y,z are all distinct positive integers and 1≤x,y,z≤2n1\leq x,y,z\leq 2n . Also, a set AA containing ordered sets (u;v)(u;v) is called "connected" with TT if for every (x;y;z)∈T(x;y;z)\in T then {(x;y),(x;z),(y;z)}∩A≠∅\{(x;y),(x;z),(y;z)\} \cap A \neq \varnothing . a) Find the number of elements of set TT . b) Prove that there exists a set "connected" with TT that has exactly 2n(n−1)2n(n-1) elements. c) Prove that every set "connected" with TT has at least 2n(n−1)2n(n-1) elements.

    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 vn-vmo/2020/p7 · Tag HENT328181 · Edit this page on GitHub · Keys: j next, k previous