olymmath

CONO-SUR 2025 Problem 6

    Sejam n≥2n \geq 2 e N=2nN = 2^n. Seja A1,A2,…,ANA_1, A_2, \ldots, A_N uma permutação (ordenação) de todos os subconjuntos de X={1,2,…,n}X = \{1, 2, \ldots, n\}. Determine o maior valor possível de

    S=∑i=1N∣Ai∩Ai+1∣⋅∣Ai∪Ai+1∣S = \sum_{i=1}^{N} |A_i \cap A_{i+1}| \cdot |A_i \cup A_{i+1}|

    onde AN+1=A1A_{N+1} = A_1.

    Nota: ∣B∣|B| denota a quantidade de elementos do conjunto BB.

    Official text Cono Sur Mathematical Olympiad 2025 official paper, page 2. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

    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 cono-sur/2025/p6 · Tag XJAKGVPJ2D · Edit this page on GitHub · Keys: j next, k previous