1. The problem statement, all variables and given/known data Show that there are exactly two homomorphisms f:C_(6) --> C_(4) 2. Relevant equations Theorem. let f: G -> G1 and h: G -> G1 be homomorphisms and assume that G=<X> is generaed by a subset X. Then f = h if and only if f(x) = h(x) for all x in X. 3. The attempt at a solution C6 = <g>, |g| = 6. The divisors of 6 are 1,2,3,6 C4 = <g'>, |g'| = 4, the divisors of 4 are 1,2,4 only 1 and 2 of C6 are the divisors of C4. so there are exactly two homomorphism. right?