Can anyone give me hints to how to prove this??(adsbygoogle = window.adsbygoogle || []).push({});

Prove that for any positive integer n, n^5 and n have the same units digit in their base 10

representations; that is, prove that n^5 = n (mod 10).

Thanks!

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

# Congruence Modulo n Proving

Loading...

Similar Threads - Congruence Modulo Proving | Date |
---|---|

I Symmetry involving prime multiplication modulo 8 | Nov 22, 2016 |

I Congruence vs equality in mod arithmetic | Aug 1, 2016 |

How to change the modulus of congruence | Oct 26, 2015 |

Congruence statements, with a statement of percentage | Jul 18, 2014 |

Wish to solve exponential congruence equation | Nov 19, 2013 |

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