... By me, it is *far* from ordinary. Chris Nash and Preda sweated blood to get this within 6% of BLS before using CycloProv: ...
306
paulmillscv@...
Feb 5, 2001 12:12 pm
Hi to all, Many thanks for the info about the 3Mn number and (aMn numbers) from various people. Yves Gallot points out that the record for 3Mn stands at...
307
mellols@...
Feb 5, 2001 5:05 pm
During my research I came across a group of primes in the following order. I was wondering if anyone knows from whence they cometh? The primes are: ...
308
Jud McCranie
jud.mccranie@...
Feb 5, 2001 5:17 pm
... Those all end in 3 or 7, could that be it? +-----------------------------------------------------------+ ... ...
309
Paul Jobling
Paul.Jobling@...
Feb 5, 2001 5:23 pm
But it is not all of the primes that are = 3 or 7 mod 10, as 47, 107, 113, 233, 263, ... are missing. __________________________________________________ Virus...
310
Phil Carmody
fatphil@...
Feb 5, 2001 5:38 pm
It's nice to see such clearly presented ideas, definitely worth having a look. I've noticed Marcel take a shot at one of the final theories, which implies that...
311
jfribrg@...
Feb 5, 2001 5:51 pm
The book "Numerical Recipes in C" contains C source code for a floating point package. If possible, switch from C++ to Java, and you get the floating point...
313
paulmillscv@...
Feb 5, 2001 9:04 pm
Hi, Just to let you know that n*X = p + 1 has now been verified for n <= 100. An Access database, prime1.mdb is available in the Files area for you to...
314
Griffith, Shaun
spg1@...
Feb 6, 2001 1:00 am
... <snip lots of stuff> Dr. Doctorow, 1) Affiliation is not everything. I don't know who you are, except who you say you are. There are wonderfully gifted...
315
d.broadhurst@...
Feb 6, 2001 1:45 am
... Thanks, Shaun, for that measured response to Osher. My problem with Osher's postings has been this: Why were they sent? They replied to nothing; until now ...
316
d.broadhurst@...
Feb 6, 2001 6:34 am
Congrats to Milton Brown for a top-100 entry: 193*10^69004+1 I reckon only 3 Mersennes and a generalized Cullen have more decimal zeros. David...
317
Phil Carmody
fatphil@...
Feb 6, 2001 10:57 am
... Yes, it's also nice to see people avoiding the simplest Proth form! (Although Harvey Dubner has spent a lot of effort running around base 10 expressions in...
318
Murad AlDamen
morad2000@...
Feb 6, 2001 11:10 am
Hi Every body I have finshed of proof that is Collatz problem is right for all numbers can you see it "http://www.angelfire.com/journal2/collatz/index.html" ...
319
Phil Carmody
fatphil@...
Feb 6, 2001 12:59 pm
... I've had to add some punctuation as I've lost super/subscripts, I hope I haven't introduced any new errors in transcribing. <<< / a(n) / 2 if a(n)=0...
320
G.S. Chaffey
amtgsc@...
Feb 6, 2001 2:35 pm
If the plus in the exponent on the first line is changed to a minus then this line works.. I havn't read the rest but it is probably the first of many...
321
novakovic_josip@...
Feb 6, 2001 6:35 pm
You must be patient, It's enough to observe p^2 and (p+1)^2, p=prime number. Then: (p+1)^2 * (1*2*4*6*...*(p-1)) / (1*2*3*5*7*..*p) = (p+1)^2 * k/p, k>1 p^2 *...
322
novakovic_josip@...
Feb 6, 2001 6:50 pm
I have already let you know that I can prove the contents under 1, 2, 3, 4. – this one not in this sequence/consecutive, 5, and 8. in "Prime Conjectures and...
324
Peter Shaw
mat7phcs@...
Feb 7, 2001 9:23 am
... This 'proof' refers to phi_k(n) for various even integers k, although it is never defined what this means. Mabye it is a well known function like phi(n)...
325
Peter Shaw
mat7phcs@...
Feb 7, 2001 9:39 am
... In fact if you look at line 4 (ignoring the gibberish) you see that this is correct in this line. However how we are supposed to make any sense of this...
326
Phil Carmody
fatphil@...
Feb 7, 2001 12:58 pm
... In this instance, Phi_2(n) is defined within the statement of Theorem 2. "For twins numbers Phi_2(n) is: ..." It's not obvious, I'll grant you, it would...
327
joe.mclean@...
Feb 7, 2001 4:05 pm
Hello all. Some of you will know about the extended Sierpinski search that I coordinate, which seeks to find primes of the form k*2^n+1 for all k less than one...
328
Milton Brown
miltbrown@...
Feb 8, 2001 6:56 am
The number 10^20000 + 56149 (shall we call it my number) sounds like a good challenge for Massively Parallel Processing. With a 10,000 PE - MPP, I estimate...
329
Peter Shaw
mat7phcs@...
Feb 8, 2001 3:11 pm
... I see it now. ... But surely that formula can't give exactly the right number of pairs?! It just gives the probability that n is between two twin primes...
330
Phil Carmody
fatphil@...
Feb 8, 2001 3:52 pm
... The factor of 2 confused me too. ... What happens if you take ranges 1..n#? You throw out all evens. (leaves n#/2) You throw out the two thirds that have...
331
mellols@...
Feb 8, 2001 5:07 pm
Has anyone out there ever come across any specific properties related to these primes: 47,107,113,233,263,307,347,353,557,563,677,743,797,953,967,977, and the...
332
Jud McCranie
jud.mccranie@...
Feb 8, 2001 5:31 pm
... Doesn't show up in the encyclopedia of integer sequences. +-----------------------------------------------------------+ ... ...
333
Peter Shaw
mat7phcs@...
Feb 9, 2001 10:11 am
... Each division by primes up to n is to an integer, but for the primes between n and sqrt(n#) it is not. Using n# only tidies up the first part of the...
334
Peter Shaw
mat7phcs@...
Feb 9, 2001 10:16 am
... I mean the set of integers between 1 and n# which are not +-1 mod any prime less than p....
335
Abhijit
asen@...
Feb 9, 2001 11:34 am
... -- ............................................................................. Mr.Abhijit Sen,SRF-II Theoretical Nuclear Physics Division Theory Group ...
336
Dick Boland
richard042@...
Feb 9, 2001 1:54 pm
Hello all, ... The "Novakovic mountain" is exactly the same mathematical object I described as Goldbach vein space in my postings on the subject. Those...
