IR@KDU Repository

On an Algorithm to Prove the Strong Goldbach Conjecture

Show simple item record

dc.contributor.author Piyadasa, RAD
dc.contributor.author Kaushalya, N
dc.date.accessioned 2018-05-23T13:19:08Z
dc.date.available 2018-05-23T13:19:08Z
dc.date.issued 2015
dc.identifier.uri http://ir.kdu.ac.lk/handle/345/1340
dc.description Article Full Text en_US
dc.description.abstract The strong Goldbach conjecture says that any even number greater than the integer can be expressed as the sum of two prime numbers which has been numerically justified up to such large numbers that of order 4 . We assume the conjecture is true for all numbers and provide simple algorithm to prove the conjecture for a special class of even numbers first. Secondly we point how the conjecture may be proved in general. en_US
dc.language.iso en en_US
dc.subject Strong conjecture en_US
dc.subject Prime numbers en_US
dc.subject Even number en_US
dc.title On an Algorithm to Prove the Strong Goldbach Conjecture en_US
dc.type Article Full Text en_US
dc.identifier.journal KDU IRC en_US
dc.identifier.pgnos 145-146 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search IR@KDU


Browse

My Account