If a is congruent to b mod n and a^k−1 is congruent to b^k−1 mod n, then a^k is congruent to b^k mod n.? n>0 and k>1(adsbygoogle = window.adsbygoogle || []).push({});

How to prove it by induction?

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

# How to prove this congruent proof?

Loading...

Similar Threads - prove congruent proof | Date |
---|---|

I Proving that an operator is unbounded | Feb 8, 2018 |

I Proving a set is linearly independant | Apr 14, 2017 |

I Proving a property when elements of a group commute | Mar 29, 2017 |

Congruent equality - how to prove? | Sep 11, 2005 |

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