I have encountered this problem in its general form: finding a^k mod n, where k is a rather large number. I have been researching on the internet for several hours but I still don't understand it well. Can anyone provide a detailed explanation as to how to solve this kind of problems?(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# Modular Mathematics

Loading...

Similar Threads - Modular Mathematics | Date |
---|---|

I Modular mathematics | Mar 27, 2017 |

B Using modular arithmetic. | Oct 18, 2016 |

Predict Digits of Irrational Numbers with Modular Arithmetic Summation? | Nov 5, 2015 |

Finding inverses in modular arithmetic | Mar 29, 2015 |

Modular arithmetic | Jul 13, 2014 |

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