Synthesizing Sums
Abstract
Polynomial functions f : N+ N+ are studied for which sums of arbitrary length f (1) + f (2) + f (3) + >... + f (n), with n ∈ N+, can be expressed by polynomial functions g : N+ N+ which involve a bounded number of operations, thus not depending on n. Open problems and extensions are presented.
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.