Synthesizing Sums
| dc.creator | Rosinger, Elemer E | |
| dc.date | 2007-02-21 | |
| dc.date.accessioned | 2026-07-07T07:48:01Z | |
| dc.date.available | 2026-07-07T07:48:01Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0702605 | |
| dc.identifier | http://arxiv.org/abs/math/0702605 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124359 | |
| dc.subject | General Mathematics | |
| dc.subject | Commutative Algebra | |
| dc.title | Synthesizing Sums | |
| dc.type | text |