Variants of Romanoff's theorem
Abstract
Let A=\an\n=1∞ and B=\bn\n=1∞ be two sequences of positive integers (not necessarily distinct). Under some restrictions on A and B, we obtain a lower bound for a number of integers n not exceeding x that can be represented as a sum n = ai + bj.
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.