![]() |
|
|
#12 | |
|
Jun 2003
13DA16 Posts |
Quote:
|
|
|
|
|
|
|
#13 |
|
Jun 2003
2·7·113 Posts |
p=2,23,53,853
Are the only case for which sum of first p primes =0 (mod p). (under 5 Million) I have searched the first 5 million primes and am continuing. No solution yet. Citrix edit: Are there any more of this type. The probability is 1/p. (which is not so bad) Last fiddled with by Citrix on 2005-11-10 at 18:27 |
|
|
|
|
|
#14 |
|
Jun 2003
2·7·113 Posts |
checked the first 12.5 Million primes ie primes under 230 Million.
Citrix |
|
|
|
|
|
#15 |
|
Jun 2003
2×7×113 Posts |
The above problem can be solved if some one can prove this or disprove the following. It might already have been conjectured by some one or proved by some one.
For every even number n >4 there exists a prime t < n/2 such that n+t is also prime! (checked to 1M) If this is the case then for us, consider a n=2*p Then t=n+t (mod p) And there are no more solutions to the problem, other than 2. Last fiddled with by Citrix on 2005-11-10 at 20:24 |
|
|
|
|
|
#16 |
|
Jun 2003
110001011102 Posts |
n>4 should be n>7
|
|
|
|
|
|
#17 | |
|
Feb 2005
22·32·7 Posts |
Quote:
|
|
|
|
|
|
|
#18 |
|
Jun 2003
30568 Posts |
Submitted the sequence.
For product ((p(2)#/2)+1)%2 is Zero (0) ((p(241)#/241)+1)%241 is Zero (0) ((p(271)#/271)+1)%271 is Zero (0) ((p(8627)#/8627)+1)%8627 is Zero (0) No more till 200,000. Citrix |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Mersenne Primes p which are in a set of twin primes is finite? | carpetpool | Miscellaneous Math | 3 | 2017-08-10 13:47 |
| Distribution of Mersenne primes before and after couples of primes found | emily | Math | 34 | 2017-07-16 18:44 |
| Conjecture about Mersenne primes and non-primes v2 | Mickey1 | Miscellaneous Math | 1 | 2013-05-30 12:32 |
| A conjecture about Mersenne primes and non-primes | Unregistered | Information & Answers | 0 | 2011-01-31 15:41 |
| possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |