Difficult: I feel like the Solovay-Strassen Primality Test could be very difficult, because translating fractions into modular has always been time consuming and confusing for me and I have a tendency of accidentally messing up somewhere along the way. So maybe if we could go over some examples and really solidify how to translate fractions into mod, that would really help me.
Interesting: Whenever I've learned/talked about how to check if something is prime or not, I've always been pointed to using the square root, but like the readings said, this isn't practical for very large numbers. I've never really had any experience with other methods of determining whether or not something was prime, so I really liked that they presented many different kinds of thinking about and finding whether or not a number is prime. I especially thought the Miller-Rabin Primality Test was really interesting and it kind of made me wonder why I've never really worked like anything like this in previous math classes and why everyone always talks about using the square root and then using all those primes when it's not exactly practical for very large numbers.
No comments:
Post a Comment