claim
Let $\aleph_0 = card(\Bbb N)$ and $\mathfrak c = card(\Bbb R)$ then
$2^{\aleph_0}=\mathfrak c$
proof
$2^{\aleph_0}=\mathfrak c \iff \exists \text{ bijection } f: \Bbb N \times \{0,1\}\rightarrow \Bbb R$
How to show the existence of bijection for the given sets? What is the most widely used approach?
$\mathfrak{c}$
gives $\mathfrak{c}$. – Andrew D. Hwang Jun 05 '17 at 12:09