Proof of Goldbach's Conjecture
| dc.creator | Javaherdashti, Reza | |
| dc.date | 2002-06-05 | |
| dc.date | 2005-02-22 | |
| dc.date.accessioned | 2026-07-07T04:48:53Z | |
| dc.date.available | 2026-07-07T04:48:53Z | |
| dc.description | After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers. We show this by DC(A)less than or equal to n. Each Row is similar to each other in properties,(so is each Range). It is proven that in an arbitrary Row for any even number greater than 2, DC(A)=2, that is to say, each prime number greater than two is the sum of two prime numbers. So Goldbach's conjecture is proved. | |
| dc.description | 11 Pages | |
| dc.identifier | https://arxiv.org/abs/math/0206033 | |
| dc.identifier | http://arxiv.org/abs/math/0206033 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64223 | |
| dc.subject | General Mathematics | |
| dc.subject | 11A41 | |
| dc.title | Proof of Goldbach's Conjecture | |
| dc.type | text |