${\bf Homework \; Problem}$: Given any real number $\epsilon > 0$, prove ${\bf very}$ carefully that there exists a positive integer $n$ such that $\dfrac{1}{2^n} < \epsilon $
Attempt:
If there is some $\epsilon_0$ so that $\dfrac{1}{2^n} \geq \epsilon_0 $ then $\dfrac{1}{\epsilon_0} \geq 2^n $
Now, notice that $\log_2 (1/\epsilon_0+1) \in \mathbb{R}$ so that by the archimidean property of reals one can find some $n_0$ so that $n_0 > \log_2 (1/\epsilon_0+1)$. Thus,
$$ \dfrac{1}{\epsilon_0 } \geq 2^n > 2^{\log_2 (1/\epsilon_0+1)} = \dfrac{1}{\epsilon_0} + 1 $$
And this is false! Is this a correct and sufficient argument? Do I need to explain more?
It is correct, but when you wrote that $\dfrac1{\varepsilon_0}\geqslant2^n$, you should have written that $\dfrac1{\varepsilon_0}\geqslant2^{n_0}$. And the first sentence needs a quantifier: If there is some $\varepsilon_0$ so that $(\forall n\in\Bbb N):\dfrac1{2^n}\geqslant\varepsilon_0$…
Note that there is a simpler proof: take $n\in\Bbb N$ such that $n>\frac1\varepsilon$. Then$$\frac1{2^n}\leqslant\frac1n<\varepsilon.$$