Thread View: sci.math.research
2 messages
2 total messages
Started by Paul Joseph Perrone
Mon, 25 Jan 1993 19:28
Number Theory
Author: Paul Joseph Perrone
Date: Mon, 25 Jan 1993 19:28
Date: Mon, 25 Jan 1993 19:28
17 lines
1096 bytes
1096 bytes
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
Re: Number Theory
Author: Paul Joseph Perrone
Date: Tue, 26 Jan 1993 02:20
Date: Tue, 26 Jan 1993 02:20
21 lines
1385 bytes
1385 bytes
This is posted in correction of my first posting (#616) regarding
prime number theory. I apologize for my mistatement of the problem,
but here is the correct statement of the problem:
What is the LARGEST set of prime numbers with the following criteria:
1) No Prime in this set can be greater than 1 million;
2) No sum nor difference between any two primes in this set
can equal any other sum or difference between any other
combinations of primes in this set?
And how can I generate these numbers?
I would appreciate any references or direction that might be given to
me toward this problem. Thanx again to any who might reply to this
posting.
Sincerely,
Paul Perrone
pjp9q@virginia.edu
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads