The inverse Goldbach problem
2001; Wiley; Volume: 48; Issue: 1-2 Linguagem: Inglês
10.1112/s0025579300014406
ISSN2041-7942
Autores Tópico(s)Finite Group Theory Research
ResumoImproved upper and lower bounds of the counting functions of the conceivable additive decomposition sets of the set of primes are established. Suppose that where, ℝ′ differs from the set of primes in finitely many elements only and . It is shown that the counting functions A(x) of ℐ and B(x) of ℬ for sufficiently large x, satisfy
Referência(s)