
Short effective intervals containing primes
... of two primes at most, we get: Corollary 1. Every odd integer 41 not more than 1:13256 1022 is a sum of at most three primes. We deduce this corollary from the preceding theorem by using a greedy algorithm. This result is an improvement of [17] where the second named author with coauthors proved a ...
... of two primes at most, we get: Corollary 1. Every odd integer 41 not more than 1:13256 1022 is a sum of at most three primes. We deduce this corollary from the preceding theorem by using a greedy algorithm. This result is an improvement of [17] where the second named author with coauthors proved a ...