Assume a polyminal is given p(x) = anx^n + an-1x^n-1 + . . . + a1^x + a0 with integer coefficients
We can evaluate this at any integer point in O(n) time using horner's rule
Now suppose there are k consecutive integers (say a,a+1,a+2...a+k-1) are given ,trivially to evaluate at each point it will take O(n) time hence a total time of k*O(n)
is there a faster way to do it exploiting the property that the given points are consecutuve ??
Thank you..
