Miller_Rabin algorithm in the second I read some blog detection theorem of positive integers x range is less than p x ^ 2=1 (mod p) launch=1 x or x=p - 1 to test 341 is not a prime number, for example, first of all, it passed that examination of the tip horse theorem, 2 ^ 340=1 (mod) 341 is probably the prime Numbers, and then must carry on the second test, and then take 2 ^ 170 as previous tip horse theorem is x x ^ 2=1 (mod) 341
I want to ask next, the range of x is not less than any positive integer p, why can 2 ^ 170 as x
Then other blog did not give the range of x, x ^ 2=1 (mod) p=& gt; X=1 (mod p) or x=p - 1 (mod p) according to the above is to understand, why not give scope to also go

CodePudding user response:

Why is wrong to the scope of positive integers less than p all right