Quantitative results of the Romanov type representation functions

From MaRDI portal
Publication:6183306




Abstract: For alpha>0, let mathscr{A}={ a_1<a_2<a_3<cdots} and mathscr{L}={ ell_1, ell_2, ell_3,cdots} quad ext{(not~necessarily~different)} be two sequences of positive integers with mathscrA(m)>(logm)alpha for infinitely many positive integers m and ellm<0.9loglogm for sufficiently integers m. Suppose further that (elli,ai)=1 for all i. For any n, let fmathscrA,mathscrL(n) be the number of the available representations listed below ell_in=p+a_i quad left(1le ile mathscr{A}(n) ight), where p is a prime number. It is proved that limsup_{n o infty } frac{f_{mathscr{A},mathscr{L}}(n)}{loglog n}>0, which covers an old result of ErdH os in 1950 by taking ai=2i and elli=1. One key ingredient in the argument is a technical lemma established here which illustrates how to pick out the admissible parts of an arbitrarily given set of distinct linear functions. The proof then reduces to the verifications of a hypothesis involving well--distributed sets introduced by Maynard, which of course would be the other key ingredient in the argument.









This page was built for publication: Quantitative results of the Romanov type representation functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183306)