Sifting Function Partition for the Goldbach Problem
| dc.creator | Song, Fu-Gao | |
| dc.date | 2008-01-05 | |
| dc.date.accessioned | 2026-07-07T08:52:48Z | |
| dc.date.available | 2026-07-07T08:52:48Z | |
| dc.description | All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the Goldbach problem can be solved under sifting out only some composite numbers. In fact, in order to prove the Goldbach conjecture, it is only necessary to show that there are prime numbers left in the residual integers after the initial sifting! This idea can be implemented by using one of the three methods called sifting function partition by integer sort, sifting function partition by intervals and comparative sieve method, respectively. These are feasible methods for solving both the Goldbach problem and the problem of twin primes. An added bonus of the above methods is the elimination of the indeterminacy of the sifting functions brought about by their upper and lower bounds. | |
| dc.description | 27 pages, 0 figure | |
| dc.identifier | https://arxiv.org/abs/0801.0786 | |
| dc.identifier | http://arxiv.org/abs/0801.0786 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145404 | |
| dc.subject | General Mathematics | |
| dc.title | Sifting Function Partition for the Goldbach Problem | |
| dc.type | text |