Let X be the number of successes of a biased coin returning head $\frac{1}{4}$ of the time within $k$ tosses. Show that $P(X\geq\frac{k}{2})\leq\frac{1}{2^{k/5}}$.
So I know that $X$ is $B(k,\frac{1}{4})$. And I was thinking about re-expressing $P(X\geq\frac{k}{2})$ as $\sum_{r=\lceil k/2\rceil}^k \binom{k}{r}(\frac{1}{4})^r(\frac{3}{4})^{k-r} =\sum_{r=\lceil k/2\rceil}^k \binom{k}{r}(\frac{3^{k-r}}{4^k})$ but I don't really know what to do afterwards.
I was told I can use $\binom{2r}{r}\leq\frac{4^r}{2}$ but the only way I can think of is to let $\binom{k}{r}\leq\binom{k}{\frac{k}{2}}\leq2^{k-1}$ for all $r$ and after that I get a very high upper bound much larger than required.
Would appreciate any help towards solving the question. Thank you.
Edit: Made a typo should have been $P(X\geq\frac{k}{2})$ instead of $P(X>\frac{k}{2}).$
Edit 2: Fixed more typos
That is quite a tight upper bound: for example $\frac{1}{2^{k/4}}$ would not work for large $k$ such as $k= 68$.
A possible approach with some gaps for you to fill: