On a Problem of Additive Number Theory†

From MaRDI portal





Let \(\{a_i\}\) be a non decreasing infinite sequence of non negative integers, \(f(n)\) the number of solutions of \(a_i+a_j = n\) and \(r(n)\) the number of solution of \(a_i+a_j \leq n\). \textit{P. Erdős} and \textit{P. Turán} [J. Lond. Math. Soc. 16, 212--215 (1941; Zbl 0061.07301)] conjectured that \(r(n)-cn = O(1)\) cannot hold. In the present paper the authors prove: (1) If \(c>0\), then \[ r(n) = cn+o(n^{1/4} \log^{-1/2}n) \] cannot hold. (2) If \(c>0\), or \(c = 0\) and \(a_k<Ak^2\) then \[ \varlimsup_{n \to \infty} {1 \over n} \sum_{k=0}^n (f(k)-c)^2 > 0. \] Theorem 2 contains a theorem of Dirac-Newman (see \textit{G. A. Dirac} [J. Lond. Math. Soc. 26, 312--313 (1951; Zbl 0043.04702)]) who proved that \(f(n)\) cannot be a constant for \(n \geq n_0\).




Cited in
(46)








This page was built for publication: On a Problem of Additive Number Theory†

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