Press "Enter" to skip to content

Goldbach’s Conjecture and the Sieve of Sundaram in R

Tomaz Kastrun promised us there would be no math on the quiz and yet here we are:

This is fun It is also O(MAX) complexity. But first some background. Since the problem is super old, we are not intending to solve it, merely to play with it. In the number theory of mathematics, the Goldbach’s conjecture states that for every even integer (greater than 2) can be expressed with the sum of two prime numbers. There are also far cries from this theory. For example, prove that every even number can be written as the sum of not more than 300.000 primes (by Schnirelman (1939)).

Read on for the functions and trials of Goldbach’s conjecture.