Problem:
Find the number of ordered pairs of integers (not necessarily distinct) such that is a "quadratic residue modulo and 35", i.e. there exists a polynomial with integer coefficients such that either of the following equivalent conditions holds:
- there exist polynomials with integer coefficients such that ;
- or more conceptually, the remainder when (the polynomial) is divided by (the polynomial) is a polynomial with (integer) coefficients all divisible by 35.
, 2015
Solution
Solution:
Answer:
By the Chinese remainder theorem, we want the product of the answers modulo and modulo (i.e. when is replaced by and , respectively).
First we do the modulo case. Since is irreducible modulo (or more conceptually, in ), exactly half of the nonzero residues modulo and (or just modulo if we're working in ) are quadratic residues, i.e. our answer is (where we add back one for the zero polynomial).
Now we do the modulo case. Since factors as modulo (or more conceptually, in ), by the polynomial Chinese remainder theorem modulo (working in ), we want the product of the number of polynomial quadratic residues modulo . By centering/evaluating polynomials at accordingly, the polynomial squares modulo these linear polynomials are just those reducing to integer squares modulo . So we have an answer of in this case.
Our final answer is thus .