Proving $|G|=pq$ and $p>q$ , $q$ does not divide $p-1$ $\implies$ $G$ is cyclic , without using Cauchy's and Sylow's theorems

454 Views Asked by At

Without using Cauchy's or Sylow's theorems , can we give a proof of the result that "If $ p,q$ are primes such that $p>q$ and $q$ does not divide $p-1$ , then any group of order $pq$ is cyclic " ?