maths
posted by jfchfrhrc .
f(x) is a polynomial with integer coefficients and degree at most 10. There are N distinct integer values for which f(n)=2, and M distinct integer values for which f(m)=−2. What is the maximum possible value of NM?

Consider a function of degree 10 which has 9 turning points. If the local max/min values are such that f(x) > 2, then there are two values of x near each extremum where f(x) is 2 or 2.
So, counting the two values of x outside the interval containing all the roots, there will be 10 places where f(x)=2 and 10 more where f(x) = 2.
10*10 = 100 
wrong

Hmmm. Got any suggestions, or just an answer key? See any problem with my logic?

75

Ahh. I see where I went wrong. You want integer values. I'll have to think on it a bit more.

Hmmm. Suppose
y = ax^10 + bx^9 + ... + k
We can only have 11 solutions to finding values for a,b,...k given
y(x)=±2 for 11 different values of x
Max MN for M+N=11 would be 6*5 = 30
How to get 75? That's strange, since 75=3*25 or 5*15
That's an odd distribution of values for x
Here's another idea. If y=±2 for some set of x values,
y^2 = 4 for those same values. If y is degree 10, y^2 is degree 20. So, if we set up a system of equations with 21 coefficients, we can get 21 points where y^2 = 4. That would allow us to have 11*10=110 for MN. Still don't get 75. 
Sry made a mid calculation,like the way u did it,is 110 correct
Respond to this Question
Similar Questions

algebra
What is the largest value of d, such that for some degree d polynomial f(x) with integer coefficients, f(x)=1024 for more than d integer values of x? 
Maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n2−1 is a product of exactly two distinct prime numbers? 
Maths
What is the sum of all integer values of n satisfying 1≤n≤100, such that n^2−1 is a product of exactly two distinct prime numbers? 
MATHS!!!Please HELP..:'(
What is the sum of all integer values of n satisfying 1≤n≤100, such that (n^2)−1 is a product of exactly two distinct prime numbers? 
algebra
Find the largest possible integer n such that there exists a nonconstant quadratic polynomial f(x) with integer coefficients satisfying f(1)∣f(2),f(2)∣f(3),…f(n−1)∣f(n). Details and assumptions: ~For (possibly … 
MATHS
Find the largest possible integer n such that there exists a nonconstant quadratic polynomial f(x) with integer coefficients satisfying f(1)∣f(2),f(2)∣f(3),…f(n−1)∣f(n). Details and assumptions For (possibly … 
heeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
plsheeeeeeeeeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
help maaaaath
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i? 
heeeelp math
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, f(x_i) is prime for all i?