MathDB
|B-A| >= 3 for any subsets A,B

Source: Iran TST 2013: TST 1, Day 1, Problem 2

April 17, 2013
floor functioninductiongroup theoryabstract algebracombinatorics proposedcombinatorics

Problem Statement

Find the maximum number of subsets from {1,...,n}\left \{ 1,...,n \right \} such that for any two of them like A,BA,B if A⊂BA\subset B then ∣B−A∣≥3\left | B-A \right |\geq 3. (Here ∣X∣\left | X \right | is the number of elements of the set XX.)
Back to ProblemsView on AoPS