Abstract

This chapter discusses some problems on some problems on additive number theory. Denote by f ( n ) the largest integer k for which there is a sequence 1 ≤ a 1 < . . . < a k ≤ n so that all the sums a i + a j are distinct. It was conjectured that f ( n ) = n 1/2 + O(1).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call