您所在的位置: 首页 >> 期刊 >> 数学计算

数学计算

《数学计算》是IVY出版社旗下的一本关注数学理论与计算应用发展的国际期刊,是数学理论与现代工业技术相结合的综合性学术刊物。主要刊登有关理论数学、应用数学,及其在自然科学、工程技术、经济和社会等各领域内的最新研究进展的学术性论文和评论性文章。旨在为该领域内的专家、学者、科研人员提供一个良好的传播、分享和探讨数学理论进展的交流平台,反映学术前沿水平,促进学术交流,推进数学理论和应用方法的发展。本刊可接收中、英文稿件。其中,中文稿件要有详细的英…… 【更多】 《数学计算》是IVY出版社旗下的一本关注数学理论与计算应用发展的国际期刊,是数学理论与现代工业技术相结合的综合性学术刊物。主要刊登有关理论数学、应用数学,及其在自然科学、工程技术、经济和社会等各领域内的最新研究进展的学术性论文和评论性文章。旨在为该领域内的专家、学者、科研人员提供一个良好的传播、分享和探讨数学理论进展的交流平台,反映学术前沿水平,促进学术交流,推进数学理论和应用方法的发展。

本刊可接收中、英文稿件。其中,中文稿件要有详细的英文标题、作者、单位、摘要和关键词。初次投稿请作者按照稿件模板排版后在线投稿。稿件会经过严格、公正的同行评审步骤,录用的稿件首先发表在本刊的电子刊物上,然后高质量印刷发行。期刊面向全球公开征稿、发行,要求来稿均不涉密,文责自负。

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