Prove that n^3-n is divisible by 6 for every integer n. Is it induction to be used here?...(adsbygoogle = window.adsbygoogle || []).push({});

**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 n^3-n is divisible by 6 for every integer n

Loading...

Similar Threads - Prove divisible every | Date |
---|---|

Prove that (n!)! is divisible by (n!)^(n-1)! | Jan 12, 2012 |

Prove (n^5 - n) is divisible by 5 by induction | Jul 20, 2008 |

Prove that phi(a^n - 1) is divisible by n | Mar 19, 2008 |

Prove a^2 + b^2 = 3(s^2 + t^2) implies both a and b must are divisible by 3 | Dec 20, 2007 |

Proving a number is divisible by 48 | May 24, 2005 |

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