Preprint
Article

A Concise Proof of Goldbach Conjecture

Altmetrics

Downloads

650

Views

451

Comments

0

This version is not peer-reviewed

Submitted:

25 October 2022

Posted:

27 October 2022

You are already at the latest version

Alerts
Abstract
The Goldbach Conjecture, which is frequently termed as “1 + 1”, has been a fascinating goal for many mathematicians over centuries. A Chinese mathematician, Dr. Jingrun Chen, proved 1 + 2, which is a great success and the best result so far achieved. Although there were several attempts proving the conjecture, these attempts are either tediously long, complicated, or logically imperfect, thus not widely accepted. Taking advantage of the periodicity of primes, here the author provides a straight forward rigorous proof for the Conjecture.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated