<s>[INST] How to prove that $[2^n \sqrt{2}],[2^{n+1} \sqrt{2}],\ldots, [2^{2n} \sqrt{2}]$ contains at least one even numbers for every integer $n\ge 1$? I tried as follows: 
If not, denote $x=\{2^{n-1}\sqrt{2}\}$, then 
  $$1-\frac{1}{2^{n+1}}<x<1.$$
Denote $y=[2^{n-1}\sqrt{2}+1]$ and assume $|\sqrt{2}-p/q|<1/q^2$, then
  $$\frac{2^{n-1}p}{q}-\frac{2^{n-1}}{q^2}<y<\frac{2^{n-1}p}{q}+\frac{2^{n-1}}{q^2}+\frac{1}{2^{n+1}}.$$
But it doesn't work.
 [/INST] By a basic trick of Diophantine approximation we have, for all positive integers $p,q$, the inequality
$$
\left|\frac pq-\sqrt2\right|\cdot\left|\frac pq+\sqrt2\right|=\left|\frac{p^2}{q^2}-2\right|\ge\frac1{q^2}.
$$
In particular, if $3/2>p/q>\sqrt2$, we get the estimate
$$
\left|\frac pq-\sqrt2\right|\ge\frac1{3q^2}.
$$
Therefore, with $M=[2^{n-1}\sqrt2]$ we get, using $x=\{2^{n-1}\sqrt2\}$,
$$
1-x=2^{n-1}(\frac{M+1}{2^{n-1}}-\sqrt2)\ge\frac1{3\cdot2^{n-1}}>\frac1{2^{n+1}}.
$$
Therefore $x<1-2^{-(n+1)}$, so your contrapositive case cannot happen.
</s>