Both and are three modulo four. Reciprocity for the Jacobi symbol, followed by the supplied remainder, givesAgain both denominators are three modulo four, soNow and . Consequentlybecause the nonzero squares modulo five are one and four. Thus , , and finallyThe congruence is soluble, with exactly two distinct solutions modulo this prime: a nonzero root and its negative. The computation uses a prime denominator in its final step; a positive Jacobi symbol with composite denominator would not by itself imply solubility.
Articles by others on the same topic
There are currently no matching articles.