1. Dr. Friedlander mentioned in his presentation that checking if a number is prime is fast. I must have dozed off or missed something because it seems like to me that one would have to check a number with all previous primes and compare the gcd. That doesn't seem very quick.
2. I wish Dr. Friedlander would have gotten into more of what he does. Much of the material covered has been covered in previous classes. Maybe have a brief portion on the future of primes. I have heard of the Riemann Conjecture for some time, but what it was about. It is interesting that the conjectures he presented haven't been proved. They seem so simple, but those are usually the hardest problems.
No comments:
Post a Comment