Show simple item record

dc.contributor.authorPiyadasa, RAD
dc.contributor.authorKaushalya, N
dc.date.accessioned2018-05-23T13:19:08Z
dc.date.available2018-05-23T13:19:08Z
dc.date.issued2015
dc.identifier.urihttp://ir.kdu.ac.lk/handle/345/1340
dc.descriptionArticle Full Texten_US
dc.description.abstractThe 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.isoenen_US
dc.subjectStrong conjectureen_US
dc.subjectPrime numbersen_US
dc.subjectEven numberen_US
dc.titleOn an Algorithm to Prove the Strong Goldbach Conjectureen_US
dc.typeArticle Full Texten_US
dc.identifier.journalKDU IRCen_US
dc.identifier.pgnos145-146en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record