Abstract
Given a binary quadratic polynomial f (x1, x2) = ax2 1 + ss x1x2 +. x2 2. Z[ x1, x2], for every c. Z and n = 2, we study the number of solutions NJ (f; c, n) of the congruence equation f (x1, x2) = c mod n in (Z/ nZ) 2 such that xi. (Z/ nZ) x for i. J subset of {1, 2}.