10的倍数分拆素数和的“1-9猜想”及思考

The“1-9 Conjecture”on Multiples of 10 Partitions of Two Primes and Thinking

在学习和研究哥德巴赫猜想的有关问题过程中,我们提出了"10的倍数总可以分拆为个位分别为3和7的2个素数之和"的猜想,并进一步提出"10的正整数倍(≥3)总可以分拆为个位分别为1和9的2个素数之和"的猜想,同时提出"对于每一个10k+d(k≥3,d=2,4,6,8),存在10k+d=p1+p2,其中素数p1、p2均在10k与10(k+1)的分拆素数和中出现"的猜想.为了验证猜想,用C语言编程、利用普通办公计算机检验,发现20亿以内的10的倍数及偶数都满足上述猜想.

Through learning and research Goldbach conjecture and related issues,on the basis of forward a conjecture:‘multiples of 10 always can be written as the sum of two primes;their single figures are 3 and 7’,we forward again a new conjecture:‘multiples of 10 always can be written as the sum of two primes;their single figures are 1 and 9’.At the same time,we forward a conjecture:For 10k+d(k≥3,d=2,4,6,8),there are p 1、p2 of 10k and 10(k+1)make 10k+d=p 1+p2.We programming with C language,and using computer examined multiples of 10 within 2 billion are satisfied.