Hey guys, I've been studying some number theory recently and have a question. We know if (a,n) = 1 then a^phi(n) is congruent to 1 (mod n)(adsbygoogle = window.adsbygoogle || []).push({});

where phi(n) = euler's totient function

Now my question is the totient function does not always return the smallest possible integer such that a^k is congruent to 1. So how do i find k if phi(n) does not equal k?

**Physics Forums - The Fusion of Science and Community**

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

# Multiplicative order

Loading...

Similar Threads for Multiplicative order | Date |
---|---|

B Associativity of Matrix multiplication | Jun 9, 2017 |

Matrix multiplication preserve order Block matrix | Aug 1, 2011 |

Multiplicative order modulo t and t/2. | Jun 21, 2011 |

Show multiplicative order is multiplicative (told this was easy but I can't see it) | May 3, 2008 |

A formula related to multiplicative order | Jul 4, 2007 |

**Physics Forums - The Fusion of Science and Community**