I have the following question :
$f:\mathbb{Z}^2\rightarrow S_6$ is a homomorphism such that $f(1,0)=(1\ 2\ 3\ 4\ 5\ 6)$. Find $f(0,1)$.
$$f(0,1)= \left(\begin{array}{ccc} 1 & 2 & 3 & 4 & 5 & 6 \\ ? & ? & 6 & ? & ? & ?\\ \end{array}\right) $$
I have no idea how to approach this problem, I guess there is a smarter method than checking for each option if $f(a,b)+f(c,d)=f(a+c,b+d)$.
Any ideas how to approach this?
Any help will be appreciated.
Expanding Matt B's solution:
the permutation $(1,2,3,4,5,6)$ only commutes with its own powers.
This is because if $\sigma$ commutes with $(1,2,3,4,5,6)$ we need $(\sigma(1),\sigma(2),\sigma(3),\sigma(4),\sigma(5),\sigma(6))=\sigma(1,2,3,4,5,6)\sigma^{-1}=(1,2,3,4,5,6)$.
So $\sigma$ must permute the elements $(1,2,3,4,5,6)$ cyclically.
Therefore there are exactly $6$ such morfisms.