Hi,(adsbygoogle = window.adsbygoogle || []).push({});

Can somebody drill me on the "congruences and modular arithmetic"? I know it is a big topic, but I think I am missing "something" in my knowledge... These things seem very unusual to me, and makes no sense sometimes.

Find smallest integer n, where:

[tex]3^n \equiv 1 (mod 7)[/tex]

Is there a systematic way of doing a such thing?

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

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!

# Modular Arithmetic, and systematic approach.

Loading...

Similar Threads - Modular Arithmetic systematic | Date |
---|---|

I Ordinal Arithmetic | May 16, 2017 |

I Do I use instrument error or arithmetic mean error? | Apr 6, 2017 |

I What is a sufficient piece of arithmetic for Gödel's first incompleteness theorem | Jun 1, 2016 |

Modular operation: Addition | Jun 4, 2012 |

Modular Arithmetic | Mar 30, 2011 |

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