olymmath

USAMO 2024 Problem 6

  • Day 2

Let n>2n > 2 be an integer and let ℓ∈{1,2,…,n}\ell \in \{1, 2,\dots, n\} . A collection A1,…,AkA_1,\dots,A_k of (not necessarily distinct) subsets of {1,2,…,n}\{1, 2,\dots, n\} is called ℓ\ell -large if ∣Ai∣≥ℓ|A_i| \ge \ell for all 1≤i≤k1 \le i \le k . Find, in terms of nn and ℓ\ell , the largest real number cc such that the inequality ∑i=1k∑j=1kxixj∣Ai∩Aj∣2∣Ai∣⋅∣Aj∣≥c(∑i=1kxi)2\sum_{i=1}^k\sum_{j=1}^k x_ix_j\frac{|A_i\cap A_j|^2}{|A_i|\cdot|A_j|}\ge c\left(\sum_{i=1}^k x_i\right)^2 holds for all positive integer kk , all nonnegative real numbers x1,x2,…,xkx_1,x_2,\dots,x_k , and all ℓ\ell -large collections A1,A2,…,AkA_1,A_2,\dots,A_k of subsets of {1,2,…,n}\{1,2,\dots,n\} .

Proposed by Titu Andreescu and Gabriel Dospinescu

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator usamo/2024/p6 · Tag MYEE8S1ZF7 · Edit this page on GitHub · Keys: j next, k previous