pith. sign in

arxiv: math/0702605 · v1 · submitted 2007-02-21 · 🧮 math.GM · math.AC

Synthesizing Sums

classification 🧮 math.GM math.AC
keywords mathbbfunctionslongrightarrowpolynomialsumsarbitraryboundeddepending
0
0 comments X
read the original abstract

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ which involve a bounded number of operations, thus not depending on $n$. Open problems and extensions are presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.