Posted by **anonymous** on Friday, June 21, 2013 at 1:48am.

For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p.

Find the sum of all primes p<1000 such that the number of such polynomials is strictly greater than p x 2^(p−2)

- math -
**shashank**, Sunday, June 23, 2013 at 9:18pm
333

## Answer this Question

## Related Questions

- math - For every prime p consider all polynomials f(x) with integer coefficients...
- math - For every positive integer n, consider all monic polynomials f(x) with ...
- heeeeeeeeelp math - For every positive integer n consider all polynomials f(x) ...
- heeeeeelp math - For every positive integer n, consider all polynomials f(x) ...
- heeeeeeelp math - For every positive integer n, consider all monic polynomials f...
- Math (algebra) - For every positive integer n, consider all monic polynomials f(...
- heeeeeeelp math3 - For every positive integer n consider all polynomials f(x) ...
- math - Find the sum of all integers m that are less than 1000 and equal to n!+1...
- heeeelp math - Find the largest possible number of distinct integer values {x_1,...
- plsheeeeeeeeeeelp math - Find the largest possible number of distinct integer ...