Goldbach’s Conjecture’s Proof

Nivedita Roy

doi:https://doi.org/10.14445/22315373/IJMTT-V65I5P509

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 5 | Year 2019 | Article Id. IJMTT-V65I5P509 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I5P509

Goldbach’s Conjecture’s Proof

Nivedita Roy

Citation :

Nivedita Roy, "Goldbach’s Conjecture’s Proof," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 5, pp. 72-73, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I5P509

Abstract

Goldbach’s Conjecture is one of the oldest and best-known and till now unsolved problem in number theory and all of mathematics. The purpose of this is to increase the understanding of the concepts in number theory. It was first posed by Christian Goldbach in a letter to Leonhard Euler. It states that : Every even integer greater than 2 can be expressed as a sum of two prime numbers. While proving it I have taken prime numbers as variables and after some operations on it, equated it with even integer greater than 2 in its basic form. It is said that the conjecture is often simple to state but difficult to solve.

Keywords

Even integer, Odd integer, Primes.

References

[1] Richstein, j. (2000). Mathematics of computation , 70 (236), 1745{1749.
[2] Saouter, y. (1998). Checking the odd goldbach conjecture up to 1020. Mathematics of computation , 67 (222), 863{866.