Proving uncountability of a set

57 Views Asked by At

Let $A$ be a subset of the real numbers, containing every integer, and such that for every $x$ and $y$ in A, there exists $z$ in A strictly comprised between them. Prove $A$ is uncountable.

1

There are 1 best solutions below

1
On BEST ANSWER

Pick $A=\mathbb Q$. Then $A$ has the given property but $A$ is countable.