According to Bertrand-Chebyshev’s theorem there is at least one prime between n and 2n for n > 1. This theorem can be easily proved if one assumes Goldbach's conjecture. According to Goldbach's conjecture every even number $latex \geq 4$ is a sum of two primes. This means that we can write $latex 2n=p_1+p_2 $ Then... Continue Reading →
Goldbach Conjecture
According to Golbach's conjecture, every even greater than 2 is the sum of two primes. Here we experimentally demonstrate that it is only true if there are infinitely many primes. Theorem: There are infinitely many primes. Proof: We prove this using Goldbach conjecture. Suppose a finite set of prime numbers P = {p1, p2, …,... Continue Reading →
Seven Proofs of Riemann’s Hypothesis
I proved twin prime conjecture. I also proved binary Goldbach’s conjecture. What do you think now I’m gonna prove Riemann’s hypothesis? Never. Nobody gives a sh** to my proofs. You are upset because no journal publishes your work. Never mind. Shut up and prove. Prove as many theorems as you can. Whether it is utter... Continue Reading →
Proof Of Binary Goldbach’s Conjecture In A Poem
The binary Goldbach’s conjecture says that Every even integer great than 2 Is the sum of two primes Who says that it is hard to prove? Here we skitch a proof Let n be any even integer greater than 2 Let n be the sum of An integer d1 And a prime p1 If d1... Continue Reading →
Mr. Monologue 