home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky sci.math:17944 alt.flame:17832
- Newsgroups: sci.math,alt.flame
- Path: sparky!uunet!stanford.edu!nntp.Stanford.EDU!ilan
- From: ilan@leland.Stanford.EDU (ilan vardi)
- Subject: Re: Frankly,my dear......was: Fermat's Last Theorem
- Message-ID: <1993Jan11.010617.13200@leland.Stanford.EDU>
- Sender: news@leland.Stanford.EDU (Mr News)
- Organization: DSG, Stanford University, CA 94305, USA
- References: <1993Jan8.042211.29463@infodev.cam.ac.uk> <1993Jan9.031339.6646@nuscc.nus.sg> <1993Jan9.144916.29965@infodev.cam.ac.uk>
- Distribution: usa
- Date: Mon, 11 Jan 93 01:06:17 GMT
- Lines: 22
-
- >In article <1993Jan9.031339.6646@nuscc.nus.sg> matmcinn@nuscc.nus.sg (brett mcinnes) writes:
- >
- >>: * the Riemann hypothesis? : : --
- >>Utterly boring in itself, like FLT; but unlike FLT, it is important
- >>because you need it to prove things that are interesting. Just imagine the
- >>sensation if it turns out to be wrong.
-
- The Riemann hypothesis is most important for its own sake. It says
- that the prime numbers are essentially as evenly distributed as
- possible and that there are no ``hidden'' tendencies for primes to
- pull in any specific direction. The clearest way to explain this last
- statement is to say that if RH were false then most numbers would have
- an even number of prime factors or most numbers would have an odd
- number of prime factors.
-
- Actually, RH is not that useful in analyzing certain problems about
- primes, for example, it says that the difference between consecutive
- prime is always smaller than about sqrt{p} which is very far from the
- conjecture that it is of order (log p)^2 or slightly larger.
- Moreover, due to work on the large sieve by Bombieri, Iwaniec etc.
- there are methods that do better than RH in some cases.
-
-