Question

Recall that if n is composite, there are at most a 1/4 chance of Miller-Rabin getting a liar. Suppose that we run Miller-Rabin N times on n and each time it thinks n may be prime. Show that the probability that n is prime (approximately) is at least (1 - log(n)/(4^N)). (Hint: it is important here that log(n) is natural log!)

Answer 1

sol lua yp fails Nhu r(n).AG) 여 in(n) In(n) n(n) dntn)

InN