IMC / 2004 / Problems / Day 1, P1
IMC 2004 · Day 1 · P1
easyset theory & logicreal analysisworth 20 pts
Let be an infinite set of real numbers such that for every finite subset . Show that is countable.
Solution (official)
Let for any integer . It follows from the inequality that . Similarly, if we define , then . Any nonzero is an element of some or , because there exists an such that , or . Then , is a countable union of finite sets, and hence countable.
How the field did
contestants scored
176
average (of 20)
16.17
solved (≥ 80%)
78.4%
near-0 (≤ 10%)
12.5%
discrimination
0.51
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.