In this problem, you can assume the following fact about least common multiples (lcm): FACT: If h, ? are integers such that h|t and ?|t, then lcm(h, ?)|tNow prove the following:Suppose p and q are distinct primes such that ordp a = h and ordq a = k
Prove that ordpq a= lcm(h, k) (just check the two conditions of order)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here