Euler's criterion is the usual procedure used for assessing the solvability of the equation x2 = b(mod m). This criterion is applicable only when b and m are relatively prime and must be applied to each b (0 ≤b < m). Described in this paper is an alternative criterion which characterizes and counts, for a general modulus m, all numbers b for which x2 = b(mod m) is solvable.
|Number of pages||7|
|Journal||International Journal of Mathematical Education in Science and Technology|
|State||Published - 1 Jan 1983|