MathDB
the union of every $k$ sets contains exactly $k+1$ points

Source: Moldova TST 2022

April 1, 2022
combinatorics

Problem Statement

a) Let nn (n2)(n \geq 2) be an integer. On a line there are nn distinct (pairwise distinct) sets of points, such that for every integer kk (1kn)(1 \leq k \leq n) the union of every kk sets contains exactly k+1k+1 points. Show that there is always a point that belongs to every set. b) Is the same conclusion true if there is an infinity of distinct sets of points such that for every positive integer kk the union of every kk sets contains exactly k+1k+1 points?