uniolympiads Ελληνικά

IMC 2004, Day 1, Problem 1

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.

Original from the official PDFLet S be an infinite set of real numbers such that |s 1 + s 2 + · · · + s k | < 1 for every finite subset {s 1 , s 2 , . . . , s k } ⊂ S. Show that S is countable. [20 points]

This transcription was compared symbol by symbol with the original, but not yet by a person.

Time on this problem 0:00

Work for at least 45 minutes before opening the solution.

Official solution

Solution. Let Sn=S∩(1n,∞)S_n = S \cap (\frac{1}{n}, \infty) 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 (-\infty, -\frac{1}{n}), 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 N} (S_n \cup S_{-n}), SS is a countable union of finite sets, and hence countable.

Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.

Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.

How did it go?