Please help me prove this. I worked hard to make my notation somewhat easy to follow:(adsbygoogle = window.adsbygoogle || []).push({});

If gcd ( ord_n(a) , ord_n(b) ) = 1 , then ord_n(a*b) = ord_n(a) * ord_n(b)

Attempted proof:

I can't see how to use the gcd condition. Which is bad news. I do realize the following.

Let k1 = ord_n(a) and k2 = ord_n(b). Hence, a^k1 == 1 (mod n) and b^k2 == 1 (mod n).

Thus, (a^k1)*(b^k2) = = 1 (mod n).

I am very stuck. Can you please help me?

HFO8

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Show multiplicative order is multiplicative (told this was easy but I can't see it)

Loading...

Similar Threads for Show multiplicative order |
---|

B Associativity of Matrix multiplication |

**Physics Forums | Science Articles, Homework Help, Discussion**