Semigraphs and Goldbach Conjecture
1Hanumesha.A.G, Assistant Professor, SJC Institute of Technology.
2Meenakshi.K, Associate professor, CMR Institute of Technology.
Manuscript received on 02 August 2019. | Revised Manuscript received on 07 August 2019. | Manuscript published on 30 September 2019. | PP: 8433-8435 | Volume-8 Issue-3 September 2019 | Retrieval Number: C6218098319/2019©BEIESP | DOI: 10.35940/ijrte.C6218.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: It is interesting to learn pure mathematics through graphs as graphs makes the study simple and easier to understand. We have the proof of Goldbach conjecture using graphs and hypergraphs.[1,2]. The author is motivated to study the proof of the conjecture using semigraphs. In this paper, using semigraphs, we discuss the Goldbach statement A number which is both even and not less than 2 can be written as a sum of 2 numbers which are not composites and we also show that every composite number can be expressed as sum of 3 or more primes.
Index Terms— PVSEWSG, UTSPVEWSG/STSPVEWSG, CPVEWSG, ETEWE
Scope of the Article: Applied Mathematics and Mechanics