MathDB
why does c sl have 9 problems

Source: ISL 2019 C9

September 22, 2020
combinatoricsIMO ShortlistIMO Shortlist 2019orzcOPtorics

Problem Statement

For any two different real numbers xx and yy, we define D(x,y)D(x,y) to be the unique integer dd satisfying 2dxy<2d+12^d\le |x-y| < 2^{d+1}. Given a set of reals F\mathcal F, and an element xFx\in \mathcal F, we say that the scales of xx in F\mathcal F are the values of D(x,y)D(x,y) for yFy\in\mathcal F with xyx\neq y. Let kk be a given positive integer. Suppose that each member xx of F\mathcal F has at most kk different scales in F\mathcal F (note that these scales may depend on xx). What is the maximum possible size of F\mathcal F?