(1). G is is finite implies o(G) is finite.
Let G be a finite group of order n and let e be the identity element in G. Then the elements of G may be written as e, g1, g2, ... gn-1. We prove that the order of each element is finite, thereby proving that G is finite implies that each element in G has finite order. Let gkbe an element in G which does not have a finite order. Since (gk)r is in G for each value of r = 0, 1, 2, ... then we conclude that we may find p, q positive integers such that (gk)p = (gk)q . Without loss of generality we may assume that p> q. Hence
(gk)p-q = e. Thus p - q is the order of gk in G and is finite.
(2). o(G) is finite implies G is finite.
This follows from the definition of order of a group, that is, the order of a group is the number of members which the underlying set contains. In defining the order we are hence assuming that G is finite. Otherwise we cannot speak about quantity.
Hope that this helps.
Let ( G ) be a finite cyclic group generated by an element ( g ). Any subgroup ( H ) of ( G ) can be expressed as ( H = \langle g^k \rangle ) for some divisor ( k ) of the order of ( G ). The factor group ( G/K ) for some subgroup ( K ) is also cyclic, and by choosing ( K ) appropriately (for instance, ( K = \langle g^m \rangle ) where ( m ) divides the order of ( G )), we can ensure that ( G/K ) is isomorphic to ( H ). Thus, every subgroup ( H ) corresponds to a factor group ( G/K ) and vice versa, establishing the desired isomorphism relationships.
numerical order
rank
range
range
Let ( G ) be a finite cyclic group generated by an element ( g ). Any subgroup ( H ) of ( G ) can be expressed as ( H = \langle g^k \rangle ) for some divisor ( k ) of the order of ( G ). The factor group ( G/K ) for some subgroup ( K ) is also cyclic, and by choosing ( K ) appropriately (for instance, ( K = \langle g^m \rangle ) where ( m ) divides the order of ( G )), we can ensure that ( G/K ) is isomorphic to ( H ). Thus, every subgroup ( H ) corresponds to a factor group ( G/K ) and vice versa, establishing the desired isomorphism relationships.
Data in order from smallest to largest or vice-versa is called numerical order. It is a systematic arrangement of numbers.
numerical order
Because the bad people of the world will always need someone to prove themselves on -and vice versa!
rank
range
range
The data are sorted.
It is ordered data.
It is ordered data.
Range what about ranking?
Ordered data.