by Counting by order of elements theorem since is a divisor of number of elements in G of order n is a multiple of for some positive integer.

gcd( )=gcd( )=1 for some positive integer.

or

if ord(G)=1 then G={e} G is abelian

if ord(G)=2 then G is abelian since if a,b in G then a*b=b*a because (a=b) or (either a or b equal e).

is this correct?