Atacertain stage in Blum ,'s game one of the player is reqierd to solve the quadratic congruence

x^2=a(mod). Asolution is said to be a square root of the integer amoduo n.= pq, with p and q
distinct odd primes ,there are exactly four incongruent square roots of a modulo n. to see this
,observe that notice that each of the partes Knows a different secret during the course of the
game the prime facter of n are Alice :s concealed inforemation ,and Bob "personal secret is his
choice of the integer x. Alice hasno way of Knowing x, so that her guess at =x among the
possible square roots of a is a real one ,with a50%chance of a modula n . he will be able to
convice Alice that she has guessed incorrectly by sendeing back to her the factors qand qof n.to
do this ,Bob simply needes to calculate gcd (x=y,n). the underlying idea is that the congruence
Although the sequence of prime numbers exhibits greate irregularities of details ,a trend is
definitely apparent "in the large ",the celebreted prime number theorem allowes us to predict
,at least in the large ".the celebrated prime number theorem allowes us to predict ,at least in
gross terms ,how maney primes there are less than agiven number .it states thatif the number .it
states that if the number is n ,then there are about n divided by , log n here log n denotes the
natural logarithm of jn primes about it.Thus , the primes ofn tells us how the priems are
distributed here in a probabilistic sense. One measre of the distribution of the prime sisth e
function