It can be concluded that ∣G∣≥p⋅q. Indeed, G contains the subset H={gnhm ∣ 0≤n<p,0≤m<q}. If gnhm=gkhs for some 0≤n,k<p and 0≤m,s<q, then gn−k=hs−m where −p<n−k<p and −q<s−m<q. Since order(g)=p and order(h)=q , where p and q are distinct primes, each non-identity element of the cyclic subgroup ⟨g⟩ has order p and each non-identity element of the cyclic subgroup ⟨h⟩ has order q. Thus, we conclude that gn−k=e and hs−m=e, and consequently the inequalities −p<n−k<p and −q<s−m<q imply n−k=0 and s−m=0. Therefore, n=k and s=m, and we conclude that ∣H∣=p⋅q.
Comments