Following are just few of my results in mathematics in particular number theory..Proofs for these are also welcome(I have my own but i want something much simpler)..
1.Take any two prime numbers greater than or equal to five.Square those and find their difference.Then the result will be divisible by 12.
2.2^(n-1/2)≡ ±1 mod n for all prime values of n...
More to come..take lots of care...
No comments:
Post a Comment