z-logo
open-access-imgOpen Access
Signed sums of polynomial values
Author(s) -
Hong Bing Yu
Publication year - 2001
Publication title -
proceedings of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.968
H-Index - 84
eISSN - 1088-6826
pISSN - 0002-9939
DOI - 10.1090/s0002-9939-01-06461-9
Subject(s) - algorithm , annotation , type (biology) , computer science , artificial intelligence , biology , ecology
We give a generalization of Bleicher’s result on signed sums of k k th powers. Let f ( x ) f(x) be an integral-valued polynomial of degree k k satisfying the necessary condition that there exists no integer d > 1 d>1 dividing the values f ( x ) f(x) for all integers x x . Then, for every positive integer n n and every integer l l , there are infinitely many integers m ≥ l m\ge l and choices of ε i = ± 1 \varepsilon _{i}=\pm 1 such that \[ n = ∑ i = l m ε i f ( i ) . n=\sum _{i=l}^{m}\varepsilon _{i}f(i). \]

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here