Prove that 12 | n^2-1 if g.c.d. (n,6)= 1.(adsbygoogle = window.adsbygoogle || []).push({});

I'm pretty sure i already proved this using fermats little theorem, 3 | n^2-1 and 2| n-1, and since n^2-1 is always greater than or equal to 24, (cept for n=1 in which case any number dividies into 0) therefore since 12=2*2*3, 12 | n^2-1

This isn't really atheistically pleasing, can anyone do this a different way?

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

# Prove that 12 | n^2-1 if g.c.d. (n,6)= 1.

Loading...

Similar Threads - Prove | 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 |

I Proving an exponent law in group theory | Mar 29, 2017 |

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