加载中…
Let be a finite set with minimum element , maximum element , and elements strictly in between. Write for the set of integers that can be written in at least ways as a sum of elements of . We prove that is “structured” for (as , ), and prove a similar theorem on the size and structure of for sufficiently large. Moreover, we construct a family of sets for which is not structured for .

生成讲解博客的中文版本

生成AI智能校验的中文版本