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.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Sorry to burst your bubble, but I could say that about the square of every odd number :P
Log in to reply
Nothing to feel bad.Had to realize that before. However, thanks Brother @Jake Lai . By the way, I don't feel bad about it because I have tried and failed. Failures are stepping stones to success
Log in to reply
Indeed! That's the attitude I admire the most!