home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!spool.mu.edu!agate!linus!linus.mitre.org!fatima!bs
- From: bs@fatima.mitre.org (Robert D. Silverman)
- Subject: Re: Number Theory
- Message-ID: <1993Jan25.234145.12744@linus.mitre.org>
- Sender: news@linus.mitre.org (News Service)
- Nntp-Posting-Host: fatima.mitre.org
- Organization: Research Computer Facility, MITRE Corporation, Bedford, MA
- References: <1993Jan25.193813.7909@murdoch.acc.Virginia.EDU>
- Date: Mon, 25 Jan 1993 23:41:45 GMT
- Lines: 23
-
- In article <1993Jan25.193813.7909@murdoch.acc.Virginia.EDU> pjp9q@honi2.acc.Virginia.EDU (Paul Joseph Perrone) writes:
- :
- :I'm looking for any references or direction in solving the following
- :problem:
- :
- :Given a set of prime numbers whose largest element is less than one
- :million. Find a set of these primes such that any sum or difference
- :between any two of these primes are NOT equal to any other sum or
- :difference between any other combination of these primes.
- :
- :Is there such a set?
-
- Without any further criteria your problem is trivial. Here is
- such a set:
-
- 2 3 1009 21319
-
- There is a VERY large number of such sets.
- --
- Bob Silverman
- These are my opinions and not MITRE's.
- Mitre Corporation, Bedford, MA 01730
- "You can lead a horse's ass to knowledge, but you can't make him think"
-