Saturday, 12 May 2018

elementary number theory - Solving a congruence -- where to start?

For which positive integers $n$ is it true that
$$1^2 + 2^2 + \cdots + (n − 1)^2 \equiv 0 \,(\text{mod } n)$$






I have no idea where to start. I'm just looking for a nudge in the right direction. Any idea how to go about solving? Thanks for any help.

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...