We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Let 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.
