Solve Goldbach Conjecture with Chandra Matrix Computation

• 作者: Jun Steed Huang Mi Zhou Qi Chen
• 来源期刊: 数学计算：中英文版
• 学科: 数学
• 关键词: CHANDRA MATRIX GOLDBACH PARTITION Key Exchange
• 年，卷（期）: 2015,（4）
• 页码范围: 71-76
• 页数: 6页
• 分类号: O1

摘要

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.