Goldbach’s Conjecture is a famous open problem in additive number theory. Essentially, the conjecture says that every even number that is greater than or equal to four can be written as the sum of two prime numbers. Prime numbers are integers that are greater than one, but only have a factor of one and themselves. Although this concept seems elementary, prime numbers are one of the most complex subsets of integers. Little is known about how exactly the prime numbers are distributed and this is the main reason why the conjecture remains unsolved. 2

1

3

2

Yes

3

3

6

3

Yes

4

6

10

4

Yes

5

10

15

5

Yes

            To find the numerator in the 6th row, 6 must be added to 15 because with each successive row, the row number is added to the previous numerator to find the current numerator, as illustrated by the above table. Next, I decided to graph the relation between the row number and the numerator: