HomePage >> Journals >> Mathematical Computation

Mathematical Computation

Mathematical Computation is an international comprehensive professional academic journal of Ivy Publisher, concerning the development of mathematical theory and computing application on the combination of mathematical theory and modern industrial technology. The main focus of the journal is the academic papers and comments of latest theoretical and apolitical mathematics improvement in the fields of nature science, engineering technology, economy... [More] Mathematical Computation is an international comprehensive professional academic journal of Ivy Publisher, concerning the development of mathematical theory and computing application on the combination of mathematical theory and modern industrial technology. The main focus of the journal is the academic papers and comments of latest theoretical and apolitical mathematics improvement in the fields of nature science, engineering technology, economy and science, report of latest research result, aiming at providing a good communication platform to transfer, share and discuss the theoretical and technical development of mathematics theory development for professionals, scholars and researchers in this field, reflecting the academic front level, promote academic change and foster the rapid expansion of mathematics theory and application technology.

The journal receives manuscripts written in Chinese or English. As for Chinese papers, the following items in English are indispensible parts of the paper: paper title, author(s), author(s)'affiliation(s), abstract and keywords. If this is the first time you contribute an article to the journal, please format your manuscript as per the sample paper and then submit it into the online submission system. Accepted papers will immediately appear online followed by printed hard copies by Ivy Publisher globally. Therefore, the contributions should not be related to secret. The author takes sole responsibility for his views.

ISSN Print:2327-0519

ISSN Online:2327-0527

Email:mc@ivypub.org

Website: http://www.ivypub.org/mc/

  0
  0

Paper Infomation

Solve Goldbach Conjecture with Chandra Matrix Computation

Full Text(PDF, 540KB)

Author: Mi Zhou, Jun Steed Huang, Qi Chen

Abstract: This paper shows a fairly simple method of lifting Chandra matrices to explain Goldbach conjecture, by lifting we mean to add a nature number to every element of the matrix, in this way we constructed a set of Chandra matrices, which are equivalent to a modulo operations for a prime check. The advantage of this method is that it offers a quick computation of large prime partition for encryption key application. In this paper, it shows that all positive even integers n ≥ 40 can be expressed as the sum of two primes, those n < 40 are trivial cases. We computed for n=40 to 400000 selectively with Matlab program. From which, we can verify that the conjecture is correct, and we can use it to construct the pseudo random key for encryption key exchanges.

Keywords: Chandra Matrix, Goldbach Partition, Key Exchange

References:

[1] Eric W. Weisstein, "Goldbach Number", MathWorld; http://mathworld.wolfram.com/GoldbachNumber.html

[2] Tomás Oliveira e Silva, "Goldbach conjecture verification", http://sweet.ua.pt/tos/goldbach.html

[3] Jeff Law, "The Circle Method on the Binary Goldbach Conjecture", 36 Pages Report, Mathematics Department, Princeton University, April 3, 2005

[4] Jingrun Chen, "On the representation of a large even integer as the sum of a prime and the product of at most two primes". Kexue Tongbao 11 (9): 385-386, 1966

[5] Henry F. Fliegel; Douglas S. Robertson, "Goldbach's Comet: the numbers related to Goldbach's Conjecture”, Journal of Recreational Mathematics, v21(1) 1-7, 1989

[6] Roger Ellman, A PROOF OF "GOLDBACH'S CONJECTURE", May 10, 2000, Roger Ellman, 320 Gemma Circle, Santa Rosa, CA 95404, USA

[7] Subhash Kak, Goldbach Partitions and Sequences, Resonance, Volume 19, Issue 11, pp 1028-1037, November 2014

[8] S Kak, Encryption and error-correction coding using D sequences, IEEE Transactions on Computers, Vol.C-34, pp.803-809, 1985

[9] Roger Howe, “A Biographical Memoir for Harish Chandra”, National Academy of Sciences, 2011

[10] L E Dickson, Goldbach’s Empirical Theorem: Every Integer is a Sum of Two Primes. In History of the Theory of Numbers, Vol.1, Divisibility and Primality, New York: Dover, pp.421-424, 2005

Privacy Policy | Copyright © 2011-2024 Ivy Publisher. All Rights Reserved.

Contact: customer@ivypub.org