$2^{(12)} \equiv 1 \pmod{13}.$
$2^{(12k)} \equiv 1 \pmod{13}.$
How do we show that there are no more solutions?
You know that $2^4 \equiv 3 \pmod{13}.$
Suppose that $r$ is the smallest positive integer such that
$2^r \equiv 1 \pmod{13}.$
Then, once $r$ is determined, you know immediately that all solutions to $2^n \equiv 3 \pmod{13}$, will be represented by the following set:
$$n \in \{ ~4, ~4 + (1 \times r), ~4 + (2 \times r), ~4 + (3 \times r), \cdots\}.$$
So, the problem reduces to determining $r$.
From Fermat's Little Theorem, you know that $2^{12} \equiv 1 \pmod{13}.$
Therefore, $r$ must be a divisor of $12$.
However, $~2^6 \equiv -1 \pmod{13}~$ and $~2^4 \equiv 3 \pmod{13}.$
Therefore, $~r~$ must equal $12.$
Therefore, the answer to the problem is
$$n \in \{ ~4, ~4 + (1 \times 12), ~4 + (2 \times 12), ~4 + (3 \times 12), \cdots\}.$$