Showing that there exists a positive integer $t$ such that $5^t\equiv -3\pmod {2^{n+4}}$ When I deal with number theory, I encounter a problem that seems to be easy but I can't prove.

let $n$ be a positive integer, there exists a positive integer $t$ such that 
  $$5^t\equiv -3\pmod {2^{n+4}}$$


Claim 1. For any $n\ge0$, $5^{2^n}-1=2^{n+2}.odd$.
By induction, $$5^{2^{n+1}}-1=(5^{2^n}-1)(5^{2^n}+1)=2^{n+2}.odd.2.odd=2^{n+3}.odd$$ since in general $5^m+1=1^m+1=2\pmod{4}$. Of course, $5^1-1=2^2.1$.
Claim 2. For every $k$, there is an $r$ such that for any $n$, $2^k|(5^{2^{k-2}n+r}+3)$.
For $k=2$, $5^n+3=1+3=0\pmod{4}$.
Suppose $2^k|(5^{2^{k-2}n+r}+3)$; then either $2^{k+1}|(5^{2^{k-1}n+r}+3)$ satisfies the claim, or else $5^{2^{k-1}n+r}+3=2^k.odd$. In this case, \begin{align*} 5^{2^{k-2}(2n+1)+r}+3&=5^{2^{k-1}n+r}.5^{2^{k-2}}+3\\
&=(5^{2^{k-1}n+r}+3)5^{2^{k-2}}-3(5^{2^{k-2}}-1)\\
&=2^k.odd.5^{2^{k-2}}-3.2^k.odd\\
&=2^k(odd-odd)\\
&=2^{k+1}a\end{align*}
Hence for every $k\ge2$ there are an infinite number of $t$ such that $5^t=-3\pmod{2^k}$.
