Find out more about how The Lecture List works.
Do you organise talks?Register to tell us about them. The Lecture List is a great place to be listed, but it's also an easy place to upload your information to. It's very simple and costs nothing. Find out more |
Find out what you can do to keep The Lecture List online
 |
|
How hard is a hard problem?
Prime numbers form the building blocks of arithmetic. But if we make a list of them, many questions arise. Pairs of primes differing by 2 (such as 5 and 7, or 101 and 103) seem to occur ‘all the way up’, but there can also be huge gaps between successive primes. So how are the prime numbers distributed? The Riemann hypothesis is a major unsolved problem whose solution would help us to answer this question.
Speaker(s): |
|
|
|
Date and Time: |
9 March 2005 at 6:00 pm |
Duration: | 1 hour |
|
|
Venue: |
Gresham College |
|
|
Tickets: |
N/A |
Available from: |
All Gresham lectures are free and open to the public. |
Additional Information: |
Seats are issued on a first come, first served basis. |
Register to tell a friend about this lecture.
If you would like to comment about this lecture, please register here.
©2003-2006 Niminim Limited. Created by 
Any ad revenue is entirely reinvested into the Lecture List's operating fund
