A short paper on prime numbers

Professor Terry Tao of UCLA gave a presentation on prime numbers and their pseudorandomness at the latest International Math Olympiad. I had not thought about the fact that it is comparatively easy to to find a random prime number of k digits, it is much harder to deterministically find one. Click on the link to get a pdf of his presentation.

About mutecypher

Old. Bold. Deal with it.
This entry was posted in Uncategorized and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s