Prove $a^k\equiv 1 \pmod k$ has no solution for infinitely many even integers k
Is the equation $x = \phi(n), x=2k, n,k \in \mathbb{Z}$, where $\phi(n)$ is the Euler totient function, solvable for all evens?