Checking the odd Goldbach conjecture up to 10(20)

摘要

Vinogradov's theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to-check this conjecture up to 10(20). [References: 10]