Strongly majorizing pairs of sequences
Source: St Petersburg 2022 10.2~11.4
September 28, 2022
combinatorics
Problem Statement
We will say that a set of real numbers is stronger than the set of real numbers , and write if among all inequalities the number of true inequalities is at least times greater than the number of false. Prove that there is no chain of sets such that . Remark: For 11.4, the constant is changed to and and is changed to and in the definition (the number of elements don't have to be equal).