Dr. Upasana's maths blog

After mastering groups of prime order, students ask me: "What happens when we multiply two primes?" This is where group theory becomes really interesting – we get multiple possibilities! Let p and q be distinct primes with p < q. We want to classify all groups of order n = pq. The Main Result Theorem: There always exists at least one group of order pq, namely the cyclic group Z_{pq}. Additional groups exist depending on whether q ≡ 1 (mod p). Case 1: If q ≢ 1 (mod p) Only one group: Z_{pq} (cyclic, abelian) Case 2: If q ≡ 1 (mod p) Two groups: Z_{pq} (cyclic, abelian) One non-abelian group of order pq Why Does This Happen? The key is Sylow Theory and the existence of normal subgroups. Fact: Every group of order pq has: A subgroup of order p (by Cauchy's theorem) A subgroup of order q (by Cauchy's theorem ) The question is: are these subgroups normal? Result: The subgroup of order q is ALWAYS normal. The subgroup of order p is normal if and only if q ≢ 1 (mod p). Ex...

Whenever I introduce this topic, students are surprised by how much structure emerges from one simple condition: the order being prime! The Fundamental Result Theorem : Every group of prime order is cyclic. If |G| = p where p is prime, then G ≅ Z_p. This means there's essentially only ONE group of any given prime order! The Proof Let G be a group with |G| = p (prime). Step 1 : Pick any non-identity element a ∈ G. Step 2 : Consider the cyclic subgroup ⟨a⟩ = {e, a, a², a³, ...} Step 3 : By Lagrange's Theorem, |⟨a⟩| divides |G| = p. Step 4 : Since p is prime, the only divisors are 1 and p. Step 5 : But |⟨a⟩| ≠ 1 because a ≠ e. Step 6 : Therefore |⟨a⟩| = p, which means ⟨a⟩ = G. Conclusion : G is cyclic!  What This Means Every non-identity element is a generator! In a group of order p: Pick ANY element except the identity It automatically generates the entire group No need to check – it's guaranteed! Examples Example 1: Groups of Order 5 Z₅ = {0, 1, 2, 3,...

 After teaching groups of prime order, students naturally ask: "What about p²?" This is where things get interesting! While prime order groups are always cyclic, p² order groups have exactly TWO possibilities. Theorem: Let G be a group of order p² where p is prime. Then G is abelian and isomorphic to either: Z_{p²} (cyclic group), or Z_p × Z_p (direct product) Proof : We use the class equation and properties of p-groups. Key Fact: Every p-group has a non-trivial center. For |G| = p², the center Z(G) has order dividing p². Since Z(G) is non-trivial, |Z(G)| ∈ {p, p²}. Case 1: If |Z(G)| = p², then Z(G) = G, so G is abelian. Case 2: If |Z(G)| = p, then |G/Z(G)| = p²/p = p (prime). By our previous theorem, G/Z(G) is cyclic. But if G/Z(G) is cyclic, then G must be abelian! Conclusion: In both cases, G is abelian .  The Two Types Type 1: Cyclic Group Z_{p²} Example: Z₉ = {0, 1, 2, 3, 4, 5, 6, 7, 8} Properties: Has elements of order p² (the generators) Number of generators = φ(p²) = ...

This is one of those theorems that makes students pause and say, "Wait, that's it?" Yes! Sometimes the most elegant mathematical truths have remarkably simple proofs. The Theorem If G is a group and |G| = p where p is prime, then G is cyclic. In other words: every group of prime order is automatically cyclic! The Proof Let G be a group with |G| = p (prime). Step 1: Pick any element a ∈ G where a ≠ e (identity). Step 2: Consider the cyclic subgroup ⟨a⟩ generated by a. By definition, ⟨a⟩ is a subgroup of G. Step 3: By Lagrange's Theorem, |⟨a⟩| divides |G| = p. Step 4: Since p is prime, its only divisors are 1 and p. Step 5: But |⟨a⟩| ≠ 1 because a ≠ e, so ⟨a⟩ contains at least {e, a}. Step 6: Therefore, |⟨a⟩| = p. Step 7: Since ⟨a⟩ is a subgroup of G with the same order as G, we have ⟨a⟩ = G. Conclusion: G is cyclic with generator a. □ Examples Example 1: Groups of Order 5 Any group of order 5 is cyclic. Take Z₅ = {0, 1, 2, 3, 4} under addition mod 5: Pick 1: ⟨1⟩ = {0, ...

 One of my students once said, "Ma'am, cyclic groups seem too simple to be important." I smiled and replied, "The most profound structures in mathematics are often the simplest!" Let me show you why cyclic groups are absolutely fundamental. What is a Cyclic Group? A group G is cyclic if there exists an element g ∈ G such that every element of G can be written as a power of g. G = ⟨g⟩ = {g^n | n ∈ ℤ} We call g a generator of the group. Examples Example 1: The Integers Under Addition ℤ = {..., -2, -1, 0, 1, 2, 3, ...} is cyclic! Generator: 1 (or -1) Every integer can be written as 1 + 1 + ... + 1 (n times) = n ℤ = ⟨1⟩ Example 2: Z₆ (Integers modulo 6) Z₆ = {0, 1, 2, 3, 4, 5} under addition modulo 6 Generator: 1 1⁰ = 0 1¹ = 1 1² = 1 + 1 = 2 1³ = 1 + 1 + 1 = 3 1⁴ = 4 1⁵ = 5 Z₆ = ⟨1⟩ But wait! Is 5 also a generator? 5¹ = 5 5² = 5 + 5 = 4 (mod 6) 5³ = 3 5⁴ = 2 5⁵ = 1 5⁶ = 0 Yes! Z₆ = ⟨5⟩ too! Example 3: A Non-Cyclic Group The Klein four-group V₄ = {e, a, b, c} where e...

  When I first teach Lagrange's Theorem, students are amazed at how such a simple statement has profound consequences. This theorem is the backbone of finite group theory! The Theorem Lagrange's Theorem : If H is a subgroup of a finite group G, then the order of H divides the order of G. In symbols: |H| divides |G| That's it! Simple statement, powerful implications. Examples Example 1: Subgroups of Z₆ G = Z₆ has order 6. What are possible subgroup orders? By Lagrange's Theorem, subgroup orders must divide 6. Possible orders: 1, 2, 3, 6 Actual subgroups: {0} has order 1  {0, 3} has order 2  {0, 2, 4} has order 3  Z₆ itself has order 6  Notice: We can't have a subgroup of order 4 or 5! Example 2: Symmetric Group S₃ |S₃| = 6 A subgroup H = {e, (12)} has order 2. Check: Does 2 divide 6? Yes! ✓ Could we have a subgroup of order 4? No! Because 4 doesn't divide 6. Important Consequences Consequence 1 : The order of any element divides the order of...

  Two essential functions in number theory help us understand divisors: tau counts them, sigma adds them up! The Tau Function τ(n) τ(n) counts the total number of positive divisors of n. Examples τ(12) = 6 because divisors are {1, 2, 3, 4, 6, 12} τ(7) = 2 (always 2 for primes!) Formula: For n = p₁^a₁ · p₂^a₂ · ... · pₖ^aₖ: τ(n) = (a₁ + 1)(a₂ + 1)...(aₖ + 1) Example: τ(36) where 36 = 2² × 3² τ(36) = (2 + 1)(2 + 1) = 9 The Sigma Function σ(n) σ(n) gives the sum of all positive divisors of n. Examples: σ(12) = 1 + 2 + 3 + 4 + 6 + 12 = 28 σ(6) = 1 + 2 + 3 + 6 = 12 Formula: For prime power p^k: σ(p^k) = (p^(k+1) - 1)/(p - 1) Both functions are multiplicative when factors are coprime! Perfect Numbers A number is perfect if σ(n) = 2n. Example: σ(6) = 12 = 2(6), so 6 is perfect! Quick Quiz What is τ(50)? Answer: 50 = 2 × 5² τ(50) = (1 + 1)(2 + 1) = 6 τ(n) is odd ⟺ n is a perfect square Both appear in distribution of primes and partition theory Essential for olympiad problems! For more numb...