sieving technique in noldbach problem

after reading a lot of sieving algorithms like Eratosthenes, Sundharam, etc. I was able to use the my own sieving technique (for this problem) in Noldbach Problem..

Screenshot from 2014-05-14 07:58:32

I heard that Goldbach Conjecture is one of the famous unproven statement in the number theory, which states that every even number can be represented by the sum of two prime numbers.(Of-course the even prime is an exception)

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s