Abstract
AbstractLet F be a system of polynomial equations in one or more variables with integer coefficients. We show that there exists a univariate polynomial $D \in \mathbb {Z}[x]$ such that F is solvable modulo p if and only if the equation $D(x) \equiv 0 \pmod {p}$ has a solution.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
