$3^k \not\equiv -1 \pmod {2^e}$ for $e > 2, k > 0$. Is this true? I have tried to prove it by expanding $(1 + 2)^k$. [Notation: $(n; m) := n! / (m! (n - m)!)$] E.g., for $e = 3$ I get: $(1+2)^k + 1 = 2 + (k; 1) 2 + (k; 2) 2^2 + (k; e) 2^e + ...$ So, here it's enough to prove that $2^3$ does not divide $2 + (k; 1) 2 + (k; 2) 2^2$. The validity for general e seems very hard to prove.
|
|
Based on pedja,we only prove that $8 \nmid 3^k+1$, 1.when $k=2m+1$,$3^k+1=3^{2m+1}+1=9^m \times 3+1 \equiv 4 \pmod{8} $ 2.when $k=2m$,$3^k+1=3^{2m}+1=9^m+1 \equiv 2 \pmod{8} $ so we have $8 \nmid 3^k+1$,this is $3^k \not\equiv -1 \pmod {2^e}$ |
|||
|
|
|
Just a bit more explanative in case the other answers are too compressed.
In 2) and 4) we conclude, that we have for even exponents k $\small 3^k \equiv 1 \pmod 8$ and for odd exponents $\small 3^k \equiv 3 \pmod 8$ and thus $\small 3^k \equiv -1 \pmod 4$ or $\small 3^k \equiv -1 \pmod 2$ but not $\small \pmod 8$ |
|||
|
|
|
Hint $\ $ Put $\rm\:m= 8,\ a = 3\:$ in $$\rm mod\ m\!:\ a^2\equiv 1\ \Rightarrow\ a^n \in \{a, 1\}\ \ so\ \ a^k\equiv -1\ \Rightarrow\ a\equiv -1\ \ or\ \ 1\equiv -1\ (\!\!\iff\!\! m=2\ or\ 1) $$ |
||||
|
|