proof:(adsbygoogle = window.adsbygoogle || []).push({});

n^2 congruent 0 or 1 (mod3) for any integer n

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

# N^2 Modular Arithmetic

Loading...

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

Modular Arithmetic and Diophantine Equations | Oct 25, 2012 |

Modular arithmetic question about functions | Oct 30, 2011 |

Modular arithmetic | Sep 3, 2011 |

Interesting modular arithmetic problem I found | Aug 2, 2011 |

Modular arithmetic in matrices | Jul 15, 2010 |

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