Tuesday, October 16, 2012

6.3, due on October 17

1. (Difficult) I'm not quite following the why behind the Miller-Rabin Primality test. Specifically, why does bi mod p and q need to reach 1 at the same time in order for n to be prime (pg. 180)? And I didn't get how the book calculated how often a composite number registers as a prime using the Miller-Rabin Primality test (pg. 178).

2. (Reflection) Once I see some examples and practice more, I think the Jacobi calculations makes testing for primes really nice. It's pretty simple. Too bad there isn't such a simple way to factor.

No comments:

Post a Comment