It follows from Dirichlet's approximation theorem that for any irrational $\alpha,\ 0<\left\lvert \frac{p}{q} - \alpha \right\rvert < \frac{1}{q^2} $ for infinitely many pairs of integers $(p,q).$ In fact, Hurwitz's theorem is a nice result which says that the best we can do with the above is replace $\ \frac{1}{q^2}\ $ with $\ \frac{1}{\sqrt{5}q^2},$ and that the result does not hold if we replace $\sqrt{5}$ with any number $A>\sqrt{5},$ so this $\ \sqrt{5}$ is an (least) upper bound.
My question is the following. Is it true that, for any irrational $\alpha,\ 0<\left\lvert \frac{p}{q} - \alpha \right\rvert < \frac{1}{q^2} $ for infinitely many pairs of integers $(p,q)$ with $q$ even?
And similar question for $q$ odd?
Or can we construct an irrational number such that the above inequality is only true for finitely many even (similarly: odd) $q$?