home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math.research
- Path: sparky!uunet!pmafire!news.dell.com!swrinde!zaphod.mps.ohio-state.edu!uwm.edu!ux1.cso.uiuc.edu!news.cso.uiuc.edu!dan
- From: pjp9q@honi2.acc.Virginia.EDU (Paul Joseph Perrone)
- Subject: Number Theory
- Message-ID: <1993Jan25.192844.7653@murdoch.acc.Virginia.EDU>
- Originator: dan@symcom.math.uiuc.edu
- Sender: Daniel Grayson <dan@math.uiuc.edu>
- X-Submissions-To: sci-math-research@uiuc.edu
- Organization: University of Virginia
- X-Administrivia-To: sci-math-research-request@uiuc.edu
- Approved: Daniel Grayson <dan@math.uiuc.edu>
- Date: Mon, 25 Jan 1993 19:28:44 GMT
- Lines: 18
-
- I am looking for references or direction in solving the following
- problem:
-
- Given a set of prime numbers, whose largest element is less than
- 1 million. Generate a set of these primes such that NO sum or
- difference between any two of these primes is equal to any other
- sum or difference between any other combination of these primes.
-
- Is there such a set?
-
- I'd appreciate any comments regarding this.
-
- Email: pjp9q@virginia.edu
-
- Thank you very much.
-
- Paul Perrone
-
-