Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2004 / Problems / Day 1, P1

IMC 2004 · Day 1 · P1

easy

Let SS be an infinite set of real numbers such that ∣s1+s2+⋯+sk∣<1|s_1 + s_2 + \dots + s_k| < 1 for every finite subset {s1,s2,…,sk}⊂S\{s_1, s_2, \dots, s_k\} \subset S. Show that SS is countable.

Solution (official)

Let Sn=S∩(1n,∞)S_n = S \cap \left( \frac{1}{n}, \infty \right) for any integer n>0n > 0. It follows from the inequality that ∣Sn∣<n|S_n| < n. Similarly, if we define S−n=S∩(−∞,−1n)S_{-n} = S \cap \left( -\infty, -\frac{1}{n} \right), then ∣S−n∣<n|S_{-n}| < n. Any nonzero x∈Sx \in S is an element of some SnS_n or S−nS_{-n}, because there exists an nn such that x>1nx > \frac{1}{n}, or x<−1nx < -\frac{1}{n}. Then S⊂{0}∪⋃n∈N(Sn∪S−n)S \subset \{0\} \cup \bigcup\limits_{n \in \mathbb{N}} (S_n \cup S_{-n}), SS 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.

Similar problems

IMC 2003 · Day 2 · P11hardavg 2.9/10 · solved 18% · near-0 42% · disc 0.50
IMC 2002 · Day 1 · P5killeravg 3.1/10 · solved 4% · near-0 44% · disc 0.58
IMC 2024 · Day 2 · P6easyavg 8.2/10 · solved 77% · near-0 11% · disc 0.35