I am having trouble with this homework question and was hoping someone could help. Cheers

Prove that 5|n(n2-1)(n2=1)

Results 1 to 6 of 6

- March 11th 2008, 10:59 PM #1

- Joined
- Mar 2008
- Posts
- 13

- March 11th 2008, 11:28 PM #2

- March 12th 2008, 01:05 AM #3
If you multiply out the brackets then you get , which is true by Fermat's little theorem.

- March 12th 2008, 07:20 AM #4

- Joined
- May 2006
- From
- Lexington, MA (USA)
- Posts
- 11,707
- Thanks
- 627

Hello, asw-88!

Prove that: .

must one of five possible forms: .

5k-2)([5k-2]^2-1)([5k-2]^2 + 1)" alt="[1]\;n \,= \,5k-2\!:\;\;N \:=\5k-2)([5k-2]^2-1)([5k-2]^2 + 1)" />

. _ . . . . . . . . . .

. _ . . . . . . . . . . . . . a multiple of 5

5k-1)([5k-1]^2-1)([5k-1]^2+1)" alt="[2]\;n \,=\,5k-1\!:\;\;N \:=\5k-1)([5k-1]^2-1)([5k-1]^2+1)" />

. . . . . . . . . . . .

. . . . . . . . . . . . . . . a multiple of 5

5k)([5k]^2 - 1)([5k]^2+1)" alt="[3]\;n \,=\,5k\!:\qquad N \:=\5k)([5k]^2 - 1)([5k]^2+1)" />

. . . . . . . . . . . . . . . a multiple of 5

. . . . . . . . . . . .

. . . . . . . . . . . . . . . a multiple of 5

. . . . . . . . . . . .

. . . . . . . . . . . . . . . a multiple of 5

. . . . . . . . . . . . . . . . .*Q.E.D.*

- March 12th 2008, 10:48 AM #5

- March 13th 2008, 07:03 AM #6