Sums of squares of integers except for a fixed one
Abstract
In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer n, we find the minimum number of squares of integers except for n whose sums represent all positive integers that are represented by a sum of squares except for it. This problem could be considered as a generalization of Dubouis's result for the case when n=0.
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.