If a + b = c, then is a + b = c (mod n) for all n?(adsbygoogle = window.adsbygoogle || []).push({});

For example while reading LeVeque's Topics in Number Theory I came across a section on Fermat's Last Theorem in which he says: a way to show c^n = a^n + b^n has no solution is to assume the infinite amount of congruences c^n = a^n + b^n (mod p) for p = 2, 3, 5, 7, ... and then derive a contradiction.

I assume what he means is: if c^n = a^n + b^n, then c^n = a^n + b^n (mod n) for any n that we choose.

Is this valid?

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

# Question on the mod operator.

Loading...

Similar Threads for Question operator | Date |
---|---|

I Question about inverse operators differential operators | Feb 9, 2018 |

Matrix operation questions | Sep 29, 2014 |

Yes/no question about non-commuting Hermitian operators | Jun 2, 2013 |

Quick question about Hermitian operators | Aug 14, 2012 |

Miscellaneous questions on operators | May 8, 2012 |

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