IMC 2004, Day 1, Problem 1
Let be an infinite set of real numbers such that for every finite subset . Show that is countable.
Original from the official PDF
This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. 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.
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?
Moves you mark come back sooner in triage.