Finding Generators of Z₂₀

Abstract Algebra · Axiom Academy

EXAMPLE Finding Generators of Z₂₀ Learn to systematically identify all generators using the gcd criterion and Euler's phi function. Different generators produce the elements of Z₂₀ in different orders. Here's how generators 1 and 3 generate all elements: Natural order: 1 generates elements sequentially Different order: 3 generates all elements but in a different sequence Key Insight: All generators produce every element of Z₂₀, but the order in which they appear differs! Excellent work! You've mastered finding generators of cyclic groups. Here's what we learned: The GCD Criterion: An element g generates Z_n if and only if gcd(g, n) = 1 Euler's Totient Function: φ(n) counts the number of generators, which equals the count of elements coprime to n For Z₂₀: Since 20 = 2² × 5, we have φ(20) = 20(1 - 1/2)(1 - 1/5) = 8 generators All 8 Generators: 1, 3, 7, 9, 11, 13, 17, 19 - these are precisely the elements less than 20 that are coprime to 20 Different Orders: Each generator produces all 20 elements but in a unique cyclic order This systematic approach works for finding generators of any cyclic group Z_n. The gcd test is both necessary and sufficient for identifying generators!

This is the written version of the interactive lesson above. See the full Abstract Algebra course.