Proceedings of the 2018 International Conference on Computer Science, Electronics and Communication Engineering (CSECE 2018)

Sieve Method: Sieve the Forward and Reverse In One Time

Authors
Sai Chuen Hui
Corresponding Author
Sai Chuen Hui
Available Online February 2018.
DOI
https://doi.org/10.2991/csece-18.2018.67How to use a DOI?
Keywords
sieve Method; sieve the forward and reverse in one time; prime number pairs; dual element set
Abstract
This article carries on " Sieve Method: Sieve the Forward and Reverse In One Time" through establishing the dual element set and forms a new foundamental mathematical theory to sieve odd prime number pairs. The conclusion verifies the formula that calculating the total number of pairs that any even number is the sum of two odd prime numbers, and the minimum is that when an even number is extacted of root, the total number of odd prime number pairs is never less than one, so the Goldbach Conjecture is solved.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2018 International Conference on Computer Science, Electronics and Communication Engineering (CSECE 2018)
Part of series
Advances in Computer Science Research
Publication Date
February 2018
ISBN
978-94-6252-487-3
ISSN
2352-538X
DOI
https://doi.org/10.2991/csece-18.2018.67How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Sai Chuen Hui
PY  - 2018/02
DA  - 2018/02
TI  - Sieve Method: Sieve the Forward and Reverse In One Time
BT  - 2018 International Conference on Computer Science, Electronics and Communication Engineering (CSECE 2018)
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/csece-18.2018.67
DO  - https://doi.org/10.2991/csece-18.2018.67
ID  - Hui2018/02
ER  -