Sorry, my reply is too late. On Wed, 18 Apr 2001 18:21:10 -0000 ... 2^32-1 is too big. ... <snip> ... I suppose that "manufacturing relations" process is not...
1016
S.Tomabechi
tomabeti@...
May 1, 2001 9:30 am
On Sun, 29 Apr 2001 01:16:13 +0200 ... <snip> ... Is it known algorithm ? I want to know the new algorithm. I had implmented Atkin-Morain ECPP. But it is...
1017
MICHAEL HARTLEY
Michael.Hartley@...
May 2, 2001 2:14 am
... I'm not sure that you can clearly define "irreducible in the logical order". Or what you mean by using 1 theorem only once. After all, I'm sure that most...
1019
d.broadhurst@...
May 2, 2001 10:48 pm
Congratulations to Giovanni La Barbera for delivering the biggest pair of twin primes that were freely conceived, i.e. not the product of a marriage of ...
1020
Satoshi Tomabechi
mint@...
May 3, 2001 8:46 am
On Wed, 02 May 2001 18:01:34 +0200 ... Your explanation is enough to understand almost everything. It is good idea to compute small power insted of large...
1021
Paul Jobling
Paul.Jobling@...
May 3, 2001 2:42 pm
Hi all, On Ribenboim p341 it says that the conjecture that there do not exists three consecutive powerful numbers is equivalent to the following (Mollin and...
1022
David Underbakke
david@...
May 3, 2001 4:30 pm
... I would like to second the congratulations. I agree that this record should stand comparison much longer than the current BLS records. As a trivia note,...
1023
paulunderwood@...
May 3, 2001 6:12 pm
Hi Paul Leyland askedme the other day about 4^n-3. As far as I know the biggest "ordinary prime" (whatever that is) is 4^7057-3 proven by Preda Milhailescu. I...
1024
jfoug@...
May 3, 2001 8:28 pm
... Especially the 4^720-3 number ;) Might you mean 4^7200-3 instead? Jim....
1025
Paul Leyland
pleyland@...
May 4, 2001 4:06 pm
... Indeed, as I am toying with the idea of searching for further examples and putting up a web page to coordinate the search, should anyone else be interested...
1026
Giovanni La Barbera
giolaba@...
May 4, 2001 11:40 pm
... record ... Thanks for your congratulations. Finding and proving were made easier by weighty improvements of the programs used. a) Sieving, finding and PRP...
1027
Michael Bell
mdb36@...
May 5, 2001 12:29 am
Hi, I discovered there is a bug in the deep factoring code in APSieve. This meant that factoring above 2^32-2^29 produces incorrect results. A fixed version...
1028
d.broadhurst@...
May 5, 2001 12:47 am
... Giovanni, like Bouk de Water, attests to Marcel Martin's amazing progress in automating the speedy proofs of arbitrary 2000-digit primes. I was recently...
1029
William F Sindelar
w_sindelar@...
May 5, 2001 2:31 pm
Hi Everybody: Fermat says that if A is a PRIME integer, then 2^A divided by A will leave a remainder of 2. It occurred to me that perhaps we might not have to...
1030
Anonymous Anonymous
progboy1@...
May 5, 2001 2:47 pm
I have been fooling around with some trigonometric functions and I have noticed an easy primality test with them. One simply plugs in a number p into the ...
1031
Jack Brennen
jack@...
May 5, 2001 2:55 pm
... You are absolutely correct about this, although you must add the condition that A be an ODD integer. This is the initial step toward coming up with the...
1032
Phil Carmody
fatphil@...
May 5, 2001 3:03 pm
... If you permit 'cosh' to be considered trigonometric (it can be reformulated in terms of sin and cos with splashings of sqrt(-1)), then according to...
1033
Phil Carmody
fatphil@...
May 5, 2001 3:13 pm
... Bill, You might want to look into (modular) exponentiation algorithms, as the calculations x^n (mod p) x^((n-1)/2) (mod p) take almost the same...
1034
d.broadhurst@...
May 5, 2001 4:31 pm
... Here's an extremely useless, yet mathematically correct trig test: C(n)=(cos(pi*((n-1)!+1)/n))^2 For n>1, C(n)=1 if and only if n is prime :-) Ribenboim...
1035
James Buddenhagen
jbuddenh@...
May 5, 2001 7:12 pm
Sorry a bit off topic. But I use ubasic a lot with number theory stuff including primes. I'm about to buy a new PC. Now-a-days that means (for me anyway)...
1036
Jud McCranie
jud.mccranie@...
May 5, 2001 7:35 pm
... WinME has a DOS window with prompt, and UBASIC works with it. Win2000 has a DOS window, and I assume UBASIC will work with it. Windows XP is coming out...
1037
Norman Luhn
nluhn@...
May 5, 2001 8:07 pm
Hi Fans ! Today, i have found a new large Quintuplet The numbers are 63687452535*1000#+1002054791 +0,+2,+6,+8,+12 (427 digits) I will send it to Tony Forbes. ...
1038
Chris Nash
chris_nash@...
May 6, 2001 2:27 am
Hi there Bill ... the ... What you've discovered is the basis for two slight improvements on Fermat probable primality. Euler's test does precisely as you...
1039
John W. Nicholson
johnw.nicholson@...
May 6, 2001 12:47 pm
Hi everyone, I'm new to the group. I see searching for 'twins' that there are some ideas similar to mine. I would greatly appreciate if someone could look at...
1040
mikeoakes2@...
May 6, 2001 8:11 pm
In a message dated 20/04/2001 21:30:09 GMT Daylight Time, ... digits). Why the lower limit on size, Henri? There is a natural cutoff set by the ability of...
1041
d.broadhurst@...
May 6, 2001 10:35 pm
... Don't forget VFYPR. For cases where N^2-1 has good -- but not yet BLS -- factorization, VFYPR is more powerful. Bouk and I and are mounting an attack on...
1042
Michael Bell
mdb36@...
May 6, 2001 11:25 pm
... Hi, I think it would be useful if there was a list of PRP's with over 15 or 20% of either N-1 or N+1 factored (or maybe 3*F1+F2>=.6 or so). This would...
1043
d.broadhurst@...
May 7, 2001 12:04 am
... Well Andy Steward has *oodles* of such animals... David...
1044
d.broadhurst@...
May 7, 2001 12:13 am
PS: My personal gigantic bete noire is Phi(2521,9926), with 10072 digits, and N-1 347 digits short of BLS. As Gollum said, we hates it.... David...
1045
joe.mclean@...
May 8, 2001 3:09 pm
Hello all. I have put up some new pages to my website which may be of general interest. I've called it, rather presumptuously, "All you want to know about...
