Editing Monte Carlo algorithm (section)

==Amplification==
For a Monte Carlo algorithm with one-sided errors, the failure probability can be reduced (and the success probability amplified) by running the algorithm ''k'' times. Consider again the Solovay–Strassen algorithm which is ''{{frac|1|2}}-correct false-biased''. One may run this algorithm multiple times returning a '''false''' answer if it reaches a '''false''' response within ''k'' iterations, and otherwise returning '''true'''. Thus, if the number is prime then the answer is always correct, and if the number is composite then the answer is correct with probability at least 1&minus;(1&minus;{{frac|1|2}})<sup>''k''</sup>&nbsp;=&nbsp;1&minus;2<sup>''&minus;k''</sup>.

For Monte Carlo decision algorithms with two-sided error, the failure probability may again be reduced by running the algorithm ''k'' times and returning the [[majority function]] of the answers.