I have the following problem :
Using the fact the following language is undecidable H: The set of all multivariate polynomial with integer coefficients [p] such that it evaluates to zero for some assignment of positive integers to its variable. Show that the language P: <p,q> the set of all pairs of multivariate polynomial both with integer coefficients, such that for some assignment of integer values p>q.
I think I can prove this by showing that H is Turing reducible from P. But I can't find a way to use that fact that p>q to show r=0.
My approach was to try to bound -1<r<1. But if -1<r<1 doesn't mean that p=0 for some assignment. Help !
Thank you ~