MathDB
Yet another guinea pig

Source: 2021 Taiwan TST Round 1 Mock Day 1 P1

July 22, 2021
combinatoricsTaiwan

Problem Statement

There are 110110 guinea pigs for each of the 110110 species, arranging as a 110×110110\times 110 array. Find the maximum integer nn such that, no matter how the guinea pigs align, we can always find a column or a row of 110110 guinea pigs containing at least nn different species.
Back to ProblemsView on AoPS