I guess I should make sure this new address is working! If you got this, then it is. Chris....
Chris Caldwell
caldwell@...
Dec 29, 2000 2:07 pm
2
... this, ... Excellent! It works! :-))) Andrey...
Andrey_601@...
Dec 29, 2000 2:49 pm
3
Hi, ... The 218MB quote is a tad high. I think peak usage is less than 32MB. The 218MB number is probably the memory usage for running an ECM curve (a lot of...
George Woltman
woltman@...
Dec 29, 2000 6:11 pm
4
Over the last 6 months I have been investigating the following 4 inter-related Gaussian integer sequences:- G0(n) = n*(1+i)^n + 1 G1(n) = n*(1+i)^n + i G2(n) =...
mikeoakes2@...
Dec 30, 2000 12:20 am
5
Over the last 6 months I have been investigating the following 4 inter-related Gaussian integer sequences:- G0(n) = n*(1+i)^n + 1 G1(n) = n*(1+i)^n + i G2(n) =...
mikeoakes2@...
Dec 30, 2000 1:28 am
6
Andrey, ... IT WON'T BE THAT KIND OF SIEVE BECAUSE THAT SIEVE MUST START AT ONE AND CONTINUOUSLY REFERENCE ONE, BUT MINE CAN START ANYWHERE. ALSO I PLAN ON...
Bill Krys
billkrys@...
Dec 30, 2000 4:47 am
7
... What he means is that you are misspelling the name -- it's spelled: Riemann...
Jack Brennen
jack@...
Dec 30, 2000 5:57 am
8
Jack and Andrey, Thanks for the correction. I guess I've been in my little "mirror" world so long that "ie" and "ei" are the same to me. Just joking. I'm sorry...
Bill Krys
billkrys@...
Dec 30, 2000 6:16 am
9
That guy who sent 2 attached files that you thought would have a virus, or got garbage when it was opened, really did attach something mathematical. I'm too...
Barubary
barubary@...
Dec 30, 2000 6:49 am
10
HI BILL AND OTHER LIST MEMBERS! ... WE CAN USE ERATOSTHEN'S SIEVE FOR *ANY* FRAGMENT IF WE HAVE A LIST OF PRIMES NOT LESS THAN SQRT(N), WHERE N IS THE LARGEST...
Andrey Kulsha
Andrey_601@...
Dec 30, 2000 11:04 am
11
When messing with really big numbers you sometimes lose the sense of what is big or small.I actually meant numbrs with 10^100 decimal digits but i see that ...
Pavlos S.
pavlos119@...
Dec 30, 2000 11:46 am
12
... For large N, you would presumably compute a^N-1 modulo N. Then you should test gcd(a^N-1 mod N,N) and gcd(b^N-1 mod N,N). Then nothing new would be learnt...
David Broadhurst
d.broadhurst@...
Dec 30, 2000 12:05 pm
13
... This was rubbish, sorry. The new online reply facility is seductive; must learn to think before I type! I was mentally confusing this idea of Pavlos with ...
David Broadhurst
d.broadhurst@...
Dec 30, 2000 12:19 pm
14
... Dear PrimeNumbers members! Congratulations on New Year, Century and Millenium! I sincerely wish you happiness, health, friendship and good primes! Your...
Andrey Kulsha
Andrey_601@...
Jan 1, 2001 12:01 am
15
Andrey and all, I concede that Eratosthene's sieve can be used for any fragment, but I still assert that we must indirectly reference "1" to generate the...
Bill Krys
billkrys@...
Jan 1, 2001 12:32 am
16
Dear All, This is my first communication with the primenumbers group, (or any group come to that) so I hope that I'm doing eveything right! My interest is with...
Stephen Taylor
sgt@...
Jan 1, 2001 5:30 pm
17
Here is a complete program which I submitted last year, to do the multiplication as a convolution product. Just compile and run it. It does not require any...
Milton Brown
miltbrown@...
Jan 1, 2001 11:35 pm
18
Hello Bill! Please mathematically define the rules of your symmetry, and I (and, probably, some other list members) will try to prove (or disprove) them. ...
Andrey Kulsha
Andrey_601@...
Jan 1, 2001 11:41 pm
19
It is removing attachments? So here it is as text: Milton L. Brown miltbrown@... // // By Milton L. Brown 8-1-2000 (in file Mult.cpp) // It takes...
Milton Brown
miltbrown@...
Jan 1, 2001 11:49 pm
20
Here are some 'linting' problems with the code. - You don't use all of the variables you have declared. - If your char buffer is 100 bytes long, the largest...
Phil Carmody
fatphil@...
Jan 2, 2001 12:53 am
21
Thanks for the hints. It was quick and dirty but it works, without optimizations. Some of thhe "h-files" that I have downloaded simply do not work. These are...
Milton Brown
miltbrown@...
Jan 2, 2001 2:06 am
22
Thanks for letting me know. It seems that the new prime pages is some how, cutting off the attachments, which I still don't understand if this is correct, or...
Milton Brown
miltbrown@...
Jan 2, 2001 3:49 am
23
Hello all,If you have trouble with the attachment, I will be posting a copy in Primeform's file areaIf you like the proof, please respond to the list with an...
Dick Boland
richard042@...
Jan 2, 2001 8:36 am
24
Hello, Regarding my proof of Goldbach's Conjecture, I had some trouble with the pictures in HTML as an attachment. You may also view my proof at...
Dick Boland
richard042@...
Jan 2, 2001 10:18 am
25
I've not yet had chance to check your proof on your web page, but the following two sentences caught my eye. ... Too late. In virtually the entire world, you...
Paul Leyland
pleyland@...
Jan 2, 2001 1:46 pm
26
These 2 statements caught my eye too. you can't claim patent rights without registration and then they are granted to you. Also, Paul is right that most...
Bill Krys
billkrys@...
Jan 2, 2001 3:01 pm
27
... Yes, I set it up that way. I thought we might use the file area. But the attachments can be turned back on if folks prefer it. Attachments can carry...
Chris Caldwell
caldwell@...
Jan 3, 2001 12:00 am
28
... Please leave them off, as at present. Non-ASCII stuff and/or long files belong in the files area, as successfully managed in PrimeForm and OpenPFGW...
David Broadhurst
d.broadhurst@...
Jan 3, 2001 12:16 am
29
... OK, I agree - leave them off. However, let me display my ignorance here. How does one access the files area? Thanks, Connie...
Conrad Eaton
ceaton@...
Jan 3, 2001 3:47 am
30
... Click on "Files" to left of message. There is the only file lodged there at present: http://www.egroups.com/files/primenumbers/Articles/antiorders.zip by...
