Signed sums of polynomial values
Let \(f(x)\) be an integer-valued polynomial of degree \(k\) satisfying the necessary condition that there exists no integer \(d>1\) dividing the values \(f(x)\) for all integers \(x\). The author proves that for any given integer \(\ell\), every positive integer \(n\) can be represented in the form \(n=\sum_{i=\ell}^m \varepsilon_i f(i)\) with suitable \(\varepsilon_i=\pm 1\), where \(m\geq \ell\) is an integer depending on \(\ell\), \(n\), and \(f(x)\).NEWLINENEWLINENEWLINEThis generalizes a result of \textit{M. N. Bleicher} [J. Number Theory 56, 36-51 (1996; Zbl 0841.11002)].
- A generalization of the Erdős-Surányi problem
- scientific article; zbMATH DE number 4103173 (Why is no real title available?)
- Weighted sums of consecutive values of a polynomial
- On the representation of integers as linear combinations of consecutive values of a polynomial
- Signed sums of terms of a sequence
This page was built for publication: Signed sums of polynomial values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781330)