A note on additive complements of the squares

Abstract

Let S=\12,22,32,...\ be the set of squares and W=\wn\n=1∞ ⊂ N be an additive complement of S so that S + W ⊃ \n ∈ N: n ≥ N0\ for some N0. Let RS,W(n) = \#\(s,w):n=s+w, s∈ S, w∈ W\ . In 2017, Chen-Fang C-F studied the lower bound of Σn=1NRS,W(n). In this note, we improve Cheng-Fang's result and get that Σn=1NRS,W(n)-N N1/2. As an application, we make some progress on a problem of Ben Green problem by showing that n→∞π216n2-wnn π4+0.193π28.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…