[tex]f(x)[/tex] will give us the smallest integer [tex]m[/tex] such that [tex]y^m \equiv 1 \bmod{x}[/tex] given that x and y are coprime(adsbygoogle = window.adsbygoogle || []).push({});

how would one go about showing that this function is multiplicative? I'm trying to do some Number Theory self study, and the problems I'm encountering are quite difficult to figure out from text alone.

I'm guessing that the Chinese remainder theorem is applicable here.

Also if we let p be prime then I know that f(p) will give the result of (p-1). This is basically proved with Euler's theorem.

Is this true or is Euler's theorem not so easily applicable here? I guess the fact that here m is the smallest integer, where's in Euler's it's not the smallest, but it's easy to prove that this doesn't matter using groups.

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

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!

# Modulo and prime numbers

Loading...

Similar Threads for Modulo prime numbers | Date |
---|---|

Using modulo 11 | Sep 15, 2014 |

A big number modulo a prime | Dec 12, 2012 |

Negative modulo question | Jul 14, 2012 |

Order of 3 modulo a Mersenne prime | Mar 7, 2009 |

Binomial coefficient modulo a prime | Jun 11, 2006 |

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