Use the following test due to Solovay and Strassen in a numerical example to
show that a given number \(n\) is not prime. (This is an example of a
probabilistic algorithm for checking primality. If the test has been passed
\(t\) times, then the remaining probability that \(n\) is nonprime is less than
\(2^{-t}\).) Choose an integer \(a\) at random from \(1, \ldots, n-1\), and then
test to see if \(\operatorname{gcd}(a, n)=1\) and \(a^{(n-1) / 2} \equiv J(a,
n)(\bmod n) .\) If \(n\) is prime, then it always
passes the test. If \(n\) is not prime, it will pass the test for less than half
of the values of \(a\) which are coprime to \(n\).