Evaluate All Order of Every Element of 60 and 61 Order of Group for Addition Composition ()
1. Introduction
We propose to study the groups of order of an element of a group, order of a group, torsion group, mixed group subgroup, normal subgroup and the integral powers of an element of a group etc. Then we discuss the order of every element in the higher 100, 105 and 107 orders of group for multiplication composition. The group notation is o or *. We will frequently omit the symbol for the group operation but we will also often write the operation as · or + when it represents multiplication or addition in a group, and write 1or 0 for the corresponding identity elements respectively. It’s addition +, multiplication × or (·) is used as a binary operation. If the group operation is denoted as a multiplication, then an element
is said to be order n if n is the least positive integer such that
or
i.e., if
and
s.t.
. The order of a is denoted by
. If
for any
, then a is said to be of zero order or infinite order [1]. Let e is the identity element in (G, +). An element
is said to be order n if
such that
or
. i.e., if
and
s.t.
. The order of a is denoted by
. If
for any
, then a is said to be of zero order or infinite order [2]. The order of a group G and the orders of its elements give much information about the structure of the group. The order of any subgroup of G divides the order of G. If H is a subgroup of G, then
, where
is called the index of H in G. This is Lagrange’s theorem; however, it is only true when G has finite order. If
, the quotient
is not true. We see that the order of every element of a group divides the order of the group. For example, in the symmetric group shown above, where
, the possible orders of the elements a, b, c. But there is no general formula relating the order of a product ab to the orders of a and b. In fact, it is possible that both a and b have finite order while ab has infinite order, or that both a and b have infinite order while ab has finite order. (i.e. [3]-[5]). But here we discuss the order of groups of higher odd, even and prime order of groups as 69, 70 and 71. Then we find out the order of every element of a group in different types of the higher even, odd and prime order of the group for composition [6] [7].
2. Integral Powers of an Element of a Group Multiplication Composition [8] [9]
Let
be a group. Let
be an arbitrary element.
By closure property, all the elements a, aa, aaa, …etc. belong to G.
Since the composition in G is associative. Hence aaa… to n factors is independent of the manner in which the factors are grouped.
If n is a positive integer, then define
, by closure property
If e is identity in G, then we define
.
If n is a negative integer, then by define
, where
is the inverse of
.
Consequently,
, since the inverse of every element of G belong to G.
According to the definition
The following law of indices can be easily proved
Thus we defined
for all integral values of n, positive, negative or zero.
Definition-1 (Multiplication Composition) ([10] [11]):
Let e be the identity element in
. An element
is said to be order n if
such that
or
. i.e., if
and
s.t.
. The order of a is denoted by
. If
for any
, then a is said to be of zero order or infinite order.
Definition-1 (Addition Composition) ([12] [13]):
Let e be the identity element in
. An element
is said to be order n if
such that
or
. i.e., if
and
s.t.
. The order of a is denoted by
. If
for any
, then a is said to be of zero order or infinite order.
Example:
1) In multiplicative group
.
,
and
s. t.
.
2) In (Z, +),
and all other elements have infinite order.
Torsion free group [14]: A group G is called a torsion free group if the identity element e is the only element of finite order.
Example:
Torsion group or periodic group [15]: A group G is said to be a torsion group or periodic group if every element of G is of finite order.
Example: The multiplication group is
Mixed Group [16]: A group G is said to be a mixed group if
at least two elements
. s.t..
1)
is finite,
2)
Example: The multiplicative group
, where
is a mixed group.
For
,
,
if
and
.
3. Significance of the Order of an Element of a Group
We begin this section of the following theorem related significance of the order of an element of a group.
3.1. Theorem [17]
Let G be a group and let
be of infinite order n. Then show that
where k is any integer and (n, k) is denoted the highest common factor of n and k.
Proof: Let
,
,
.
Now we will prove that
.
We have,
(1)
or,
or,
or,
(2)
or,
And,
or, n = mp, k = mg ; where p and q integers and
From (2) we get,
or,
or,
, or,
or,
or,
or,
where
(3)
Now,
[By Associative law]
or,
(4)
or,
or,
or,
(5)
or, h/p
From (3) and (5) then we get,
or,
QED
3.2. Theorem [18]
Show that the order of every element of a finite group is finite.
Proof: Let G be a finite group with multiplication composition.
Let
be an arbitrary element.
Now we will prove that
is finite.
By closure property, all the elements a2 = a ∙ a, a3 = a ∙ a ∙ a, … etc. belong to G
i.e. a, a2, a3, a4, a5, a6, a7, … etc. belong to G.
But all these elements are not distinct. Since G is finite.
Let e be the identity in G, then
.
Let us suppose that
Also m and n are finite and hence p is a finite positive integer.
Now p is a positive integer s.t.
.
This proves that
4. Result and Discussion
In this section we developed the result of order of every element for multiplication composition in the higher 60and 61 orders of group for addition composition.
4.1. Find Order of Every Element of the Group {0, 1, 2, 3, …, 60} the Composition Being Addition Modulo 61 ([16] [19]-[22])
Solution: Let
is a group. Where G = {0, 1, 2, 3, …, 60} and
denotes addition modulo 61. Here e = 0.
In addition notation
na = e and n is a least positive integer
For O(e) = 1 for identity element of every group.
To determine O(1):
1 ∙ 1 = 1, 2 ∙ 1 = 2, 3 ∙ 1 = 3, 4 ∙ 1 = 4, 5 ∙ 1 = 5, 6 ∙ 1 = 6, …, 20 ∙ 1 = 20, 21 ∙ 1 = 21, 22 ∙ 1 = 22, …, 41 ∙ 1 = 41, 42 ∙ 1 = 42, 43 ∙ 1 = 43, …, 59 ∙ 1 = 59, 60 ∙ 1 = 60, 61 ∙ 1 = 61 = 0 = e
Thus 61(1) = e and n(a) ≠ e for n < 61.
To determine O(2):
1 ∙ 2 = 2, 2 ∙ 2 = 4, 3 ∙ 2 = 6, 4 ∙ 2 = 8, 5 ∙ 2 = 10, 6 ∙ 2 = 12, …, 20 ∙ 2 = 40, 21 ∙ 2 = 42, 22 ∙ 2 = 24, …, 58 ∙ 2 = 116 = 55, 59 ∙ 2 = 57, 60 ∙ 2 = 120 = 59, 61 ∙ 2 = 122 = 0 = e
Thus 61(2) = e and n(a) ≠ e for n < 61.
To determine O(3):
1 ∙ 3 = 3, 2 ∙ 3 = 6, 3 ∙ 3 = 9, 4 ∙ 3 = 12, 5 ∙ 3 = 15, 6 ∙ 3 = 18, …, 20 ∙ 3 = 60, 21 ∙ 3 = 63 = 2, 22 ∙ 3 = 66 = 5, …, 59 ∙ 3 = 55, 60 ∙ 3 = 180 = 58, 61 ∙ 3 = 183 = 0 = e
Thus 61(3) = e and n(a) ≠ e for n < 61.
To determine O(4):
1 ∙ 4 = 4, 2 ∙ 4 = 8, 3 ∙ 4 = 12, 4 ∙ 4 = 16, 5 ∙ 4 = 20, 6 ∙ 4 = 24, …, 20 ∙ 4 = 80 = 19, 21 ∙ 4 = 84 = 23, 22 ∙ 4 = 88 = 27, …, 59 ∙ 4 = 236 = 53, 60 ∙ 4 = 240 = 57, 61 ∙ 4 = 244 = 0 = e
Thus 61(4) = e and n(a) ≠ e for n < 61.
To determine O(5):
1 ∙ 5 = 5, 2 ∙ 5 = 10, 3 ∙ 5 = 15, 4 ∙ 5 = 20, 5 ∙ 5 = 25, 6 ∙ 5 = 30, …, 20 ∙ 5 = 100 = 39, 21 ∙ 5 = 105 = 44, 22 ∙ 5 = 110 = 49, …, 59 ∙ 5 = 295 = 51, 60 ∙ 5 = 300 = 56, 61 ∙ 5 = 305 = 0 = e
Thus 61(5) = e and n(a) ≠ e for n < 61.
To determine O(6):
1 ∙ 6 = 6, 2 ∙ 6 = 12, 3 ∙ 6 = 18, 4 ∙ 6 = 24, 5 ∙ 6 = 30, 6 ∙ 6 = 36, …, 20 ∙ 6 = 120 = 59, 21 ∙ 6 = 126 = 4, 22 ∙ 6 = 132 = 10, …, 59 ∙ 6 = 354 = 49, 60 ∙ 6 = 360 = 55, 61 ∙ 6 = 366 = 0 = e
Thus 61(6) = e and n(a) ≠ e for n < 61.
To determine O(7):
1 ∙ 7 = 7, 2 ∙ 7 = 14, 3 ∙ 7 = 21, 4 ∙ 7 = 28, 5 ∙ 7 = 35, 6 ∙ 7 = 42, …, 20 ∙ 7 = 140 = 18, 21 ∙ 7 = 147 = 25, 22 ∙ 7 = 154 = 32, …, 59 ∙ 7 = 413 = 47, 60 ∙ 7 = 420 = 54, 61 ∙ 7 = 427 = 0 = e
Thus 61(7) = e and n(a) ≠ e for n < 61.
To determine O(8):
1 ∙ 8 = 8, 2 ∙ 8 = 16, 3 ∙ 8 = 24, 4 ∙ 8 = 32, 5 ∙ 8 = 40, 6 ∙ 8 = 48, …, 20 ∙ 8 = 160 = 38, 21 ∙ 8 = 168 = 46, 22 ∙ 8 = 178 = 56, …, 59 ∙ 8 = 472 = 45, 60 ∙ 8 = 480 = 53, 61 ∙ 8 = 488 = 0 = e
Thus 61(8) = e and n(a) ≠ e for n < 61.
To determine O(9):
1 ∙ 9 = 9, 2 ∙ 9 = 18, 3 ∙ 9 = 27, 4 ∙ 9 = 36, 5 ∙ 9 = 45, 6 ∙ 9 = 54, …, 20 ∙ 9 = 180 = 58, 21 ∙ 9 = 189 = 6, 22 ∙ 9 = 198 = 15, …, 59 ∙ 9 = 531 = 43, 60 ∙ 9 = 540 = 52, 61 ∙ 9 = 549 = 0 = e
Thus 61(9) = e and n(a) ≠ e for n < 61.
To determine O(10):
1 ∙ 10 = 10, 2 ∙ 10 = 20, 3 ∙ 10 = 30, 4 ∙ 10 = 40, 5 ∙ 10 = 50, 6 ∙ 10 = 60, …, 20 ∙ 10 = 200 = 17, 21 ∙ 10 = 210 = 27, …, 59 ∙ 10 = 590 = 41, 60 ∙ 10 = 600 = 51, 61 ∙ 10 = 610 = 0 = e
Thus 61(10) = e and n(a) ≠ e for n < 61.
To determine O(11):
1 ∙ 11 = 11, 2 ∙ 11 = 22, 3 ∙ 11 = 33, 4 ∙ 11 = 44, 5 ∙ 11 = 55, 6 ∙ 11 = 66, …, 20 ∙ 11 = 220 = 37, 21 ∙ 11 = 231 = 48, …, 60 ∙ 11 = 660 = 50, 61 ∙ 11 = 671 = 0 = e
Thus 61(11) = e and n(a) ≠ e for n < 61.
To determine O(12):
1 ∙ 12 = 12, 2 ∙ 12 = 24, 3 ∙ 12 = 36, 4 ∙ 12 = 44, 5 ∙ 12 = 60, 6 ∙ 12 = 11, …, 20 ∙ 12 = 240 = 57, 21 ∙ 12 = 252 = 88, …, 60 ∙ 12 = 720 = 49, 61 ∙ 12 = 732 = 0 = e
Thus 61(12) = e and n(a) ≠ e for n < 61.
To determine O(13):
1 ∙ 13 = 13, 2 ∙ 13 = 26, 3 ∙ 13 = 39, 4 ∙ 13 = 52, 5 ∙ 13 = 65 = 4, …, 20 ∙ 13 = 260 = 16, 21 ∙ 13 = 273 = 29, …, 60 ∙ 13 = 780 = 48, 61 ∙ 13 = 793 = 0 = e
Thus 61(13) = e and n(a) ≠ e for n < 61.
To determine O(14):
1 ∙ 14 = 14, 2 ∙ 14 = 28, 3 ∙ 14 = 42, 4 ∙ 14 = 56, 5 ∙ 14 = 70 = 9, …, 20 ∙ 14 = 280 = 36, 21 ∙ 14 = 294 = 50, …, 60 ∙ 14 = 840 = 47, 61 ∙ 14 = 854 = 0 = e
Thus 61(14) = e and n(a) ≠ e for n < 61.
To determine O(15):
1 ∙ 15 = 15, 2 ∙ 15 = 30, 3 ∙ 15 = 45, 4 ∙ 15 = 60, 5 ∙ 15 = 75 = 14, …, 20 ∙ 15 = 300 = 56, 21 ∙ 15 = 315 = 10, …, 60 ∙ 15 = 900 = 46, 61 ∙ 15 = 915 = 0 = e
Thus 61(15) = e and n(a) ≠ e for n < 61.
To determine O(16):
1 ∙ 16 = 16, 2 ∙ 16 = 32, 3 ∙ 16 = 48, 4 ∙ 16 = 64 = 3, …, 20 ∙ 16 = 320 = 15, 21 ∙ 16 = 336 = 31, …, 60 ∙ 16 = 960 = 45, 61 ∙ 16 = 976 = 0 = e
Thus 61(16) = e and n(a) ≠ e for n < 61.
To determine O(17):
1 ∙ 17 = 17, 2 ∙ 17 = 34, 3 ∙ 17 = 51, 4 ∙ 17 = 68 = 7, …, 20 ∙ 17 = 340 = 35, 21 ∙ 17 = 357 = 31, …, 60 ∙ 17 = 1020 = 44, 61 ∙ 17 = 1037 = 0 = e
Thus 61(17) = e and n(a) ≠ e for n < 61.
To determine O(18):
1 ∙ 18 = 18, 2 ∙ 18 = 36, 3 ∙ 18 = 54, 4 ∙ 18 = 72 = 11, …, 20 ∙ 18 = 360 = 55, 21 ∙ 18 = 378 = 12, …, 60 ∙ 18 = 1080 = 43, 61 ∙ 18 = 1098 = 0 = e
Thus 61(18) = e and n(a) ≠ e for n < 61.
To determine O(31):
1 ∙ 31 = 31, 2 ∙ 31 = 62 = 1, 3 ∙ 31 = 93 = 32, 4 ∙ 31 = 124 = 2, 5 ∙ 31 = 155 = 33, 6 ∙ 31 = 186 = 3, …, 59 ∙ 31 = 1829 = 60, 60 ∙ 31 = 1860 = 30, 61 ∙ 31 = 1891 = 0 = e
Thus 61(31) = e and n(a) ≠ e for n < 61.
To determine O(32):
1 ∙ 32 = 32, 2 ∙ 32 = 64 = 3, 3 ∙ 32 = 96 = 35, 4 ∙ 32 = 128 = 6, 5 ∙ 32 = 160 = 38, 6 ∙ 32 = 192 = 9, …, 59 ∙ 32 = 1888 = 58, 60 ∙ 32 = 1920 = 29, 61 ∙ 32 = 1952 = 0 = e
Thus 61(32) = e and n(a) ≠ e for n < 61.
…
To determine O(58):
1 ∙ 58 = 58, 2 ∙ 58 = 55 = 3, …, 60 ∙ 58 = 3480 = 3, 61 ∙ 58 = 3538 = 0 = e
Thus 61(58) = e and n(a) ≠ e for n < 61.
To determine O(59):
1 ∙ 59 = 59, 2 ∙ 59 = 118 = 4, …, 60 ∙ 59 = 3540 = 2, 61 ∙ 59 = 3599 = 0 = e
Thus 61(59) = e and n(a) ≠ e for n < 61.
To determine O(60):
1 ∙ 60 = 60, 2 ∙ 60 = 120 = 59, …, 60 ∙ 60 = 3600 = 1, 61 ∙ 60 = 3660 = 0 = e
Thus 61(60) = e and n(a) ≠ e for n < 61.
4.2. Find Order of Every Element of the Group {0, 1, 2, 3, …, 59} the Composition Being Addition Modulo 60 ([23]-[28])
Solution: Let
is a group. Where G = {0, 1, 2, 3, …, 59} and
denotes addition modulo 60. Here e = 0.
In addition, notation
na = e and n is a least positive integer
For O(e) = 1 for identity element of every group.
To determine O(1):
,
,
,
,
,
,
,
, …,
Thus 60(1) = e and n(a) ≠ e for n < 60.
To determine O(2):
,
,
,
,
,
, …,
Thus 30(2) = e and n(a) ≠ e for n < 60.
To determine O(3):
,
,
,
,
,
,
,
Thus 20(3) = e and n(a) ≠ e for n < 60.
To determine O(4):
,
,
,
,
, …,
,
Thus 15(4) = e and n(a) ≠ e for n < 60.
To determine O(5):
,
,
,
,
,
,
Thus 12(5) = e and n(a) ≠ e for n < 60.
To determine O(6):
,
,
,
,
,
,
Thus 10(6) = e and n(a) ≠ e for n < 60.
To determine O(7):
,
,
,
,
, …,
,
, …,
, …,
,
, …,
,
, …,
,
Thus 60(7) = e and n(a) ≠ e for n < 60.
To determine O(8):
,
,
,
,
, …,
,
,
Thus 15(8) = e and n(a) ≠ e for n < 60.
To determine O(9):
,
,
,
, …
,
,
Thus 20(9) = e and n(a) ≠ e for n < 60.
To determine O(10):
,
,
Thus 6(10) = e and n(a) ≠ e for n < 60.
To determine O(11):
,
,
,
, …,
,
,
, …,
,
, …,
,
,
, …,
,
Thus 60(11) = e and n(a) ≠ e for n < 60.
To determine O(12):
,
,
,
Thus 5(12) = e and n(a) ≠ e for n < 60.
To determine O(13):
,
,
,
, …,
,
, …,
,
, …,
,
, …,
, …,
,
Thus 60(13) = e and n(a) ≠ e for n < 60.
To determine O(14):
,
,
, …,
,
, …,
,
,
Thus 30(14) = e and n(a) ≠ e for n < 60.
To determine O(15):
,
,
Thus 4(15) = e and n(a) ≠ e for n < 60.
To determine O(16):
,
,
, …,
,
Thus 15(16) = e and n(a) ≠ e for n < 60.
To determine O(17):
,
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(17) = e and n(a) ≠ e for n < 60.
To determine O(18):
,
,
, …,
Thus 10(18) = e and n(a) ≠ e for n < 60.
To determine O(19):
,
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(19) = e and n(a) ≠ e for n < 60.
To determine O(20):
,
,
,
Thus 3(20) = e and n(a) ≠ e for n < 60.
To determine O(21):
,
,
, …,
,
, …,
,
Thus 20(21) = e and n(a) ≠ e for n < 60.
To determine O(22):
,
,
, …,
,
, …,
,
Thus 30(22) = e and n(a) ≠ e for n < 60.
To determine O(23):
,
,
, …,
,
, …,
,
,
, …,
,
Thus 60(23) = e and n(a) ≠ e for n < 60.
To determine O(24):
,
,
,
Thus 5(24) = e and n(a) ≠ e for n < 60.
To determine O(25):
,
,
, …,
,
Thus 12(25) = e and n(a) ≠ e for n < 60.
To determine O(26):
,
, …,
,
, …,
,
Thus 30(26) = e and n(a) ≠ e for n < 60.
To determine O(27):
,
, …,
,
, …,
,
.
Thus 20(27) = e and n(a) ≠ e for n < 60.
To determine O(28):
,
, …,
,
Thus 15(28) = e and n(a) ≠ e for n < 60.
To determine O(29):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(29) = e and n(a) ≠ e for n < 60.
To determine O(30):
,
Thus 2(30) = e and n(a) ≠ e for n < 60.
To determine O(31):
,
, …,
,
, …,
,
, …,
,
, …
,
Thus 60(31) = e and n(a) ≠ e for n < 60.
To determine O(32):
,
, …,
,
Thus 15(32) = e and n(a) ≠ e for n < 60.
To determine O(33):
,
, …,
,
, …,
,
Thus 20 (33) = e and n (a) ≠ e for n < 60.
To determine O(34):
,
, …,
,
, …,
,
Thus 30(34) = e and n(a) ≠ e for n < 60.
To determine O(35):
,
,
, …,
,
Thus 12(35) = e and n(a) ≠ e for n < 60.
To determine O(36):
,
,
,
,
Thus 5(36) = e and n(a) ≠ e for n < 60.
To determine O(37):
,
, …,
,
, …,
,
, …,
,
, …,
Thus 60(37) = e and n(a) ≠ e for n < 60.
To determine O(38):
,
, …,
, …,
Thus 30(38) = e and n(a) ≠ e for n < 60.
To determine O(39):
,
, …,
,
,
,
,
Thus 20(39) = e and n(a) ≠ e for n < 60.
To determine O(40):
,
,
Thus 3(40) = e and n(a) ≠ e for n < 60.
To determine O(41):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(41) = e and n(a) ≠ e for n < 60.
To determine O(42):
,
,
, …,
,
Thus 10(42) = e and n(a) ≠ e for n < 60.
To determine O(43):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(43) = e and n(a) ≠ e for n < 60.
To determine O(44):
,
, …,
,
Thus 15(44) = e and n(a) ≠ e for n < 60.
To determine O(45):
,
,
,
Thus 4(45) = e and n(a) ≠ e for n < 60.
To determine O(46):
,
, …,
,
, …,
,
Thus 30(46) = e and n(a) ≠ e for n < 60.
To determine O(47):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(47) = e and n(a) ≠ e for n < 60.
To determine O(48):
,
,
,
,
Thus 5(48) = e and n(a) ≠ e for n < 60.
To determine O(49):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(49) = e and n(a) ≠ e for n < 60.
To determine O(50):
,
,
,
,
Thus 6(50) = e and n(a) ≠ e for n < 60.
To determine O(51):
,
, …,
,
,
, …,
,
Thus 20(51) = e and n(a) ≠ e for n < 60.
To determine O(52):
,
, …,
Thus 15(52) = e and n(a) ≠ e for n < 60.
To determine O(53):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(53) = e and n(a) ≠ e for n < 60.
To determine O(54):
,
,
, …,
,
Thus 6(54) = e and n(a) ≠ e for n < 60.
To determine O(55):
,
,
, …,
,
,
Thus 12(55) = e and n(a) ≠ e for n < 60.
To determine O(56):
,
, …,
,
Thus 15(56) = e and n(a) ≠ e for n < 60.
To determine O(57):
,
,
, …,
,
Thus 20(57) = e and n(a) ≠ e for n < 60.
To determine O(58):
,
, …,
,
, …,
,
Thus 30(58) = e and n(a) ≠ e for n < 60.
To determine O(59):
,
, …,
,
, …,
,
, …,
,
, …,
,
Thus 60(59) = e and n(a) ≠ e for n < 60.
5. Analysis of the Result
We discussed the result of order of every element for multiplication composition in the 60 and 61 orders of group for multiplication composition. In fact, we can use composition related theorem to evaluate order of group of different orders such as order
etc., i.e., whose order is not so high (Not Higher Order Groups). As a result, we use multiplication related theorems to evaluate the order of groups of the higher order of group for composition. Here, to find orders of elements of a cyclic group. Thus, it has been found necessary and convenient to work or solve these structures in details.
6. Conclusion
In this work, we developed the higher order of elements of a group for various higher orders of a group. This result is very important for the order of every element of a group. For this reason, we can determine the orders of the elements in groups of different orders. In different situations, once it was found that a given solution satisfies the basic result of one structure, and having known the properties of that structure, it becomes extremely easy to forecast the behavior of the situation. This result in this paper will be advantageous for group theory related to subgroups and order of elements of a group. Thus, the demands of the work of mathematical problems as like as physical problems such as groups, number systems, vectors, matrices and so on.