Is this one similar to the proof for n7-n|42?Prove n^5-n is divisible by 30 for all natural numbers
Faster alternatives:Is this one similar to the proof for n7-n|42?
Isn't that the same way you prove n7-n|42?Faster alternatives:
Fermat's Little Theorem
Basic facts about arbitrary runs of consecutive integers
Brute Modular Force
Prove (n(n-1)/2)|(nk-n)Isn't that the same way you prove n7-n|42?