Friday 23 October 2015

elementary set theory - Prove ${1,2,4,8,16,32,ldots}$ is countably infinite

Been working on this question for a while now and despite scouring my notes and the internet, i still haven't been able to come up with a good answer...



Prove that the set of numbers which are powers of 2 (i.e. $\{1,2,4,8,16,32,\ldots\}$) is a countably infinite set.




How would i go about proving this? could i use proof by induction?



Any help would be greatly appreciated :)

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...