Approximation by binary fractions For general Diophantine approximation, the Thue–Siegel–Roth theorem states that for any irrational algebraic number $x$, and any $\varepsilon>0$, there exists a constant $c=c(x,\varepsilon)$ such that
$$
\left|x-\frac{p}q\right| > \frac{c}{q^{2+\varepsilon}},
$$
for any integers $p$ and $q>0$. 
My first question is, is it possible to get larger lower bound, if we are allowed to choose $x$ carefully?
The second question is, does there exist $x$ such that
$$
\left|x-\frac{p}{2^k}\right| > \frac{c}{2^{k}},
$$
for any $p$ and $k$, with some constant $c>0$?
 A: So if you pick $x$ by specifying the continued fraction, and it is bounded, then you will have  $\left| x-\frac{p}{q} \right| \gt \frac{c}{q^{2}}$ However it is unlikely (with random choice) to be algebraic. The continued fraction expansion of a number $x$ is eventually priodic (and hence, of course, bounded) exactly if $x$ is of the form $\frac{u+\sqrt{v}}{w}$ (i.e. is algebraic of degree $2$.)  I do not know if any algebraic number of degree $3$ or greater is known to have a bounded or known to have an unbounded continued fraction, however there are reasons to think that they are all unbounded.
The binary expansion of $x$ plays a similar role to your second question. Any real number who binary expansion has a bounded length to the runs of consecutive identical bits (and only such real numbers) will satisfy a bound $\left|x-\frac{p}{2^k}\right| > \frac{c}{2^{k}}$ where $c$ depends on the longest run of $0$'s or $1$'s . This is automatic if the binary expansion is eventually periodic, which means that $x$ is rational (and not of the form $\frac{n}{2^k}$ .) Many other examples can be given by specifying an appropriate binary expansion, but perhaps not in any other (known) way.
