I have recently got some interest in Primes and tried to explore more and more in it. Late, at night 11:00, I found this beautiful theorem.

I found that" Every prime when divided by four gives a remainder 1 or -1.

Therefore, square of every prime leaves a remainder 1 when divided by 4.

(sum_{i=1}^n) P gives a remainder n when divided by 4.( where P is a prime)

The primes we take doesn't include 2.

## Comments

Sort by:

TopNewestSorry to burst your bubble, but I could say that about the square of every odd number :P – Jake Lai · 2 years, 1 month ago

Log in to reply

@Jake Lai . By the way, I don't feel bad about it because I have tried and failed. Failures are stepping stones to success – Sudhir Aripirala · 2 years, 1 month ago

Nothing to feel bad.Had to realize that before. However, thanks BrotherLog in to reply

– Jake Lai · 2 years, 1 month ago

Indeed! That's the attitude I admire the most!Log in to reply