IMC 1998, Day 2, Problem 5
Suppose that is a family of spheres (i.e., surfaces of balls of positive radius) in , , such that the intersection of any two contains at most one point. Prove that the set of those points that belong to at least two different spheres from 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. For every choose spheres such that and ; denote by the three components of , where the notation is such that , and is the only point of , and choose points with rational coordinates , , and . We claim that is uniquely determined by the triple ; since the set of such triples is countable, this will finish the proof.
To prove the claim, suppose, that from some we arrived to the same using spheres and components of . Since contains at most one point and since , we have that or ; similarly for 's and 's. Exchanging the role of and and/or of 's and 's if necessary, there are only two cases to consider: (a) and and (b) , and . In case (a) we recall that contains only and that , so . In case (b) we get from that ; so since is open and connected, and is just one point, we infer that and we are back in the already proved case (a).
Transcribed from the official solutions, page 3. 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.