olymmath

CWMO 2010 Problem 3

    Determine all possible values of positive integer nn , such that there are nn different 3-element subsets A1,A2,...,AnA_1,A_2,...,A_n of the set {1,2,...,n}\{1,2,...,n\} , with ∣Ai∩Aj∣≠1|A_i \cap A_j| \not= 1 for all i≠ji \not= j .

    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 cn-wmo/2010/p3 · Tag 93S7EJ4ZW3 · Edit this page on GitHub · Keys: j next, k previous