A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Expression of Composite Number as Primes Using Hyper Graphs
2015
International Journal of Soft Computing, Mathematics and Control
Preserved Fulltext
The prime factorization theorem states that every integer greater than 1 can be expressed as a product of primes. Goldbach conjecture states that every even number greater than 2 can be expressed as a sum of 2 primes. In this paper we study the proof of prime factorization theorem using hypergraphs and we show that every sum of two or more primes gives a composite number. KEY WORDS prime factorization theorem, complete prime vertex composite edge weighted hypergraph
doi:10.14810/ijscmc.2015.4101
fatcat:bqdgxooeozhcnlwiuul2bwqf3q