Prime Numbers
|
5.1 A Monte-Carlo Primality Tester.
Next: 5.2 Randomized Algorithms and Up: 5 Randomness in Computing. Previous: 5 Randomness in Computing. 5.1 A Monte-Carlo Primality Tester. The factoring problem seems very hard. But to test a number for having factors turns out to be much easier than to find them. It also helps if we supply the computer with a coin-flipping device. We now consider a Monte Carlo algorithm, i.e. one that with ...
|
| |
Goldbach Conjecture@