Since 257 is a prime number, we have
(25734)=(2572)(25717)=(25717)=(17257)=(172)=1
Therefore, the original congruence equation must have a solution.
Since 257=4×26+1, we have n=26,λ=6,μ=1, 2u+1=1, so au=34. We also have
342=1156≡128(mod257)3422≡1282=16384≡193≡−64(mod257)3423≡(−64)2=4096≡241≡−16(mod257)3424≡(−16)2=256≡−1(mod257)
Thus,
μ=4,λ−μ=6−4=2,
Hence,
h=22⋅t=4t,t is odd
And we have □
1⩽t⩽24−1=15
Since 257=12×21+5, 3 is a quadratic non-residue modulo 257, so we have
(b2u)h=(32)4t=(38)t
However, we have
38=94=812=6561≡136≡−121(mod257)(38)3≡(−121)3=(14641)(−121)≡(−8)(−121)≡968≡197≡−60(mod257)(38)5≡(−8)(−60)=480≡−34(mod257)
Therefore, we must have t=5, so h=4t=4×5=20,
n−h=26−20=44,
Since
(38)5≡−34(mod257)
We have
344≡34×340≡81×(−34)≡−2754≡−184≡73(mod257)
And
34×73=2482≡169≡−88(mod257)
Thus, by (10), the solution to the original equation is
x≡±88(mod257)
For the case of pα modulo, where p>2,α>1.
We already know how to determine whether
x2≡a(modp),(a,p)=1
has a solution, and if it does, how to find it. In this section, we will discuss, if p is an odd prime, α is an integer greater than 1, the congruence equation
x2≡a(modpα),(α,p)=1