answersLogoWhite

0

Proof By Contradiction:

Claim: R\Q = Set of irrationals is countable.

Then R = Q union (R\Q)

Since Q is countable, and R\Q is countable (by claim), R is countable because the union of countable sets is countable.

But this is a contradiction since R is uncountable (Cantor's Diagonal Argument).

Thus, R\Q is uncountable.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

ReneRene
Change my mind. I dare you.
Chat with Rene
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa

Add your answer:

Earn +20 pts
Q: How prove that the set of irrational numbers are uncountable?
Write your answer...
Submit
Still have questions?
magnify glass
imp