home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!snorkelwacker.mit.edu!galois!riesz!tycchow
- From: tycchow@riesz.mit.edu (Timothy Y. Chow)
- Subject: Re: Prime conjecture
- Message-ID: <1992Aug12.222658.3148@galois.mit.edu>
- Sender: news@galois.mit.edu
- Nntp-Posting-Host: riesz
- Organization: None. This saves me from writing a disclaimer.
- References: <Aug.11.04.02.28.1992.3070@remus.rutgers.edu> <1992Aug11.162953.13961@uwm.edu> <18990@nntp_server.ems.cdc.com>
- Date: Wed, 12 Aug 92 22:26:58 GMT
- Lines: 19
-
- In article <18990@nntp_server.ems.cdc.com> mstemper@ems.cdc.com writes:
- <In article <1992Aug11.162953.13961@uwm.edu>, radcliff@csd4.csd.uwm.edu (David G Radcliffe) writes:
- <|>
- <|> Conjecture: There exists a k > 0 so that p + k is prime
- <|> for infinitely many primes p.
- <|>
- <|> Does anybody know the status of the this conjecture?
- <
- <I believe that
- < There exist infinitely many primes p
- < Such that p+2 is prime
- <has been proven, which would prove this conjecture by showing k=2.
-
- No. This is the Twin Prime Conjecture, which is still open.
- --
- Tim Chow tycchow@math.mit.edu
- Where a calculator on the ENIAC is equipped with 18,000 vacuum tubes and weighs
- 30 tons, computers in the future may have only 1,000 vacuum tubes and weigh
- only 1 1/2 tons. ---Popular Mechanics, March 1949
-