olymmath

CGMO 2010 Problem 1

    Let nn be an integer greater than two, and let A1,A2,⋯ ,A2nA_1,A_2, \cdots , A_{2n} be pairwise distinct subsets of {1,2,,n}\{1, 2, ,n\} . Determine the maximum value of ∑i=12n∣Ai∩Ai+1∣∣Ai∣⋅∣Ai+1∣\sum_{i=1}^{2n} \dfrac{|A_i \cap A_{i+1}|}{|A_i| \cdot |A_{i+1}|} Where A2n+1=A1A_{2n+1}=A_1 and ∣X∣|X| denote the number of elements in X.X.

    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

    Similar problems

    These problems have the most words in common with this statement.

    Locator cn-gmo/2010/p1 · Tag 27S2F71RJW · Edit this page on GitHub · Keys: j next, k previous