Check if the set of numbers : $\{0, 1, 2, 2^2, ..., 2^{15} \pmod {17}\}$ form a complete set of residues.
My simple question: is there any short route to find the answer, rather than checking it individually. I mean that if there is any property that can be used to achieve the same.
The trick is to realize that for $0, 1=2^0; 2^1, ... 2^{15}$ to be complete residue system, the $2^k$ must be distinct. And if they aren't distinct then there must be $2^a \equiv 2^b$ for some $a \ne b$. (Or some $2^k \equiv 0 \mod 17$ but that means $17|2^k$ and that $2^{m;m\ge k} \equiv 0 \mod 17$ and that's obviously not the case.
If $a< b$ and $2^a \equiv 2^b \mod 17$ then $2^a(2^{a-b}-1) \equiv 0 \mod 17$ so $17|2^a(2^{a-b}-1)$ so $2^{k=a-b} \equiv 1 \mod 17$ for some $k$.
A little intuition should make us think that $b|16$. Why is that intuitive? Well, because if $2^0 \equiv 1\mod 17$ then $2^k\equiv 2^{2k} \equiv 2^{3k} \equiv 1 \mod 17$ will go in cycles. And as there are only $17$ residue classes and $0$ is not an equivalency class of a power of $2$ there are $16$ non-zero equivalency classes. That's not hard and fast but it should be an intuitive thought.
So try to test $2^8, 2^4, 2^2, 2^1$. As $2^4 = 16\equiv -1$ we have $2^8 \equiv 1 \mod 17$ and so the $2^0, ...., 2^{15}$ are not distinct.
It's not a complete residue system.