- Lord we praise and glorify Your Holy Name. We

thank You for this wonderful day that You’ve given us
and for another chance to live, for us to be able to
continuously adore You. Lord God, forgive every one
of us in our sins. We are asking for Your love, care
and guidance for each and every one of us and for
our family and loved ones. Please give our teacher
wisdom and enough knowledge. Protect us Lord from
all evil deeds. All these in Your Mighty Name. Amen.
1. (Z, +)={….-3,-2,-1, 0, 1, 2, 3…..}
Cyclic Group
2. (Z6,+)= {0,1,2,3,4,5,}
Cyclic Group
3. [U(8, *] = {1, 3, 5, 7}
Not a Cyclic Group
4. (Q, *) = (all fractions and some decimals)
Cyclic Group
5. The Klein-4 Group (V4)
Not a Cyclic Group
“ARRANGE ME!”
CCYCLI GPORUS

CYCLIC GROUPS
“NIFITE CCYCLI GPORUS”

FINITE CYCLIC GROUPS

BUSGPORUS

SUBGROUPS
REMTHEO

THEOREM
SNEGERTORA

GENERATORS
SOMORPHICI

ISOMORPHIC
SELEMENT

ELEMENTS
At the end of the lesson, the learners are able to:

a. define the finite cyclic groups;

b. identify the elements of the subgroups;
c. familiarize themselves with the use of theorems and its
corollaries in finding the elements and orders of the subgroups;
d. show cooperation in the discussion through participating in every
activity.
 FINITE CYCLIC
GROUPS
- A finite cyclic group is a group satisfying the following
equivalent conditions:
 It is both finite and cyclic.
 It is isomorphic to the group of integers modulo n for
some positive integers n.
- In this fact we are going to solve in this lesson.

 What are the subgroups does G? How many?

 What are the possible orders of the elements in g?
 What are the generators of G? How many?
 
• If G = <a> is a finite cyclic group of order
n, then:
1.A is an element of order n.
2. = if and only if
3.G = { e, a, a²,….., }
4.G
, ….)
 
Example: Let G = <a> be a finite cyclic group order of 18 ().
List down the elements of the following subgroups:
1. <>
2. <>
3. <>
4. <>
 
 1. < >= ? |18|

* =
* =  * =
*= * = but a 18 mod 18 is 0
* = =
But 20 modulo 18 is congruent to
Now if gets multiplied to a to the fourth once
again
* =
* =
 
< >= {e, , ,,,,} therefore = 9 orders
 
2. <> = ? |18|

= , 24 mod 18 =
=

<> = {e, , } therefore = 3 orders

  3. <> = ?
* =
* = mod =
*=
* =
* = mod =
* =
* = mod =
*=  
<> is a generator of G.
*=
* = mod =
*=
* = mod =
* =
*=
* = mod =
*=
* = =0

 <> = {e, , , , , , , , , , , ,a, , , , } therefore = 18 orders

  THEOREM. Let a be an element of order n in a group and let r
be a given positive integer.
Let d = gcd(n,r). Then
1. <> = <>
2. = n/d

<>
r=4 n = 18
 <> = <>
 = n/d
d = gcd(n,r)
= 18/2
gcd(18,4) = 2
= 9 orders
d= 2
<> = <>
 
Corollary 1. In a finite cyclic group, the order of each
element divides the order of the group. Consequently, the
order of each subgroup divides the order of the group.

G = <a> order n
G = { e, a, a²,….., }
r {0, 1, 2,… n-1}
Subgroups: < divides the order of the group.
= n/d, where d is the gcd(n,r)
*d=n
/n
=
 
< divides the order of the group.
< divides the |18|
=

18 = (1,2,3,6,9,18)
1. <> = { e, , ,,,,} therefore = 9 elements
9 is divisible by 18

2. <> = {e, , } therefore = 3 orders

3 is divisible by 18

3. <> = {e, , , , , , , , , , , ,a, , , , } therefore = 18 orders

18 is divisible by 18
 COROLLARY 2. Let G = <a> be a finite group of order n. Then <> = <> if
and only if gcd(n,r) gcd(n,s). Consequently, = if and only if gcd(n,r) =
gcd(n,s).

For example:
 <> = <>  = <>  = <>
 
COROLLARY 3. Let G = <a> be a finite cyclic group of order n. The
generators of G are precisely the elements of the form of , where
gcd (n,r) = 1

Remember: =

Question: When is an element a generator ?

generates G <> = G || = |G| = n
n=
gcd(n,r)
=1
 
For Example:

G = <a> |a| = 18
G= {e, a, , … }

 
G = {}
  REMARKS. In = { 0,1,2,…n-1}, the generators are precisely the integers k
such that gcd (n,k) = 1

Example: Let G = <a> be a finite cyclic group of order 36.

1. How many generators of G? How many?
2. How many elements are there in H = <> and K = <>
3. What is the order of H .

 
So lets just look at the integers relatively prime to 36.
G = { } = 12 generators
 2. How many elements are there in H = <> and K = <>?
|H| = |
Formula:
n = 36 r= 20

= =9

|K| = |
Formula: = = = 4
 3. What is the order of H .

|H| =9
|K| = 4

H =9

H =4

|H | = 1
 Example: how many generators does have?

Generators: the positive integers < 20 relatively prime>

= {1, 3,7,9,11,13,17,19}
=8

Fact: the set of generators of is an abelian group under

multiplication modulo n. This group is denoted by
 = {1, 3,7,9,11,13,17,19} = 8 elements
So according to this fact this 8 elements will form a group under
multiplication modulo
13 x 7 = 91 mod 20 = 11
 Remarks: If G is a finite cyclic group of order n, then the number of
generators of G is equal to the numbers of positive integers less
than n which are relatively prime to n, denoted by .

Example: Compute the following.

Using the Euler-Phi factorization, what we need is a prime
factorization.

= =
=(
=2
= 8 elements
 
2. = ) =
= ()(
=8 6
= 48 elements

3. = )
= ()(
= (18)(2)(20)
= 720 elements
   
 Let G = <a> be a finite cyclic group order of 30.
1. List down the elements of the subgroup and prove if it is an
element or not. (3pts)
2. Using the theorem determine how many elements are there in
the subgroup. (2pts)
Formula:
<= =
| = n/d
3. Look for the generators that are relatively prime to 30.
 
• Using Euler-Phi Factorization compute the following to determine
how may elements in the following subgroups.
1.  
 Answer:

1. |}
2. < =
n = 30 r= 6
d= gcd(n,r) = 3
 
| = n/d
| = 30/3
= 10
3. generators that are relatively prime to 30 = (1,7,11,13,17,19,23,29)
 
 
=
=
= (- ) (
= (8-4) (6)
= 24 elements
 
 
=
=
= (2-1) (3-1) ()
= (1) (2) (20)
= 40 elements
Thank you!