摘要
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.
