olymmath

APMO 1998 Problem 1

  • Paper

Let FF be the set of all nn -tuples (A1,…,An)(A_1, \ldots, A_n) such that each AiA_{i} is a subset of {1,2,…,1998}\{1, 2, \ldots, 1998\} . Let ∣A∣|A| denote the number of elements of the set AA . Find ∑(A1,…,An)∈F∣A1∪A2∪⋯∪An∣\sum_{(A_1, \ldots, A_n)\in F} |A_1\cup A_2\cup \cdots \cup A_n|

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 apmo/1998/p1 · Tag G1SFP77494 · Edit this page on GitHub · Keys: j next, k previous