Prime numbers and primality testing is a Restricted Group with 1117 members.
 Prime numbers and primality testing

 Restricted Group,
 1117 members
Computational prime projects
Expand Messages
 We count 351 members on this prime numbers list at the moment.
I was wondering how many and what prime project(s) they follow
at present. I counted all my prime projects together and I got
1) Find primes k*720^n+1 with n=1..open and k=2..719
2) Find a counterexample for my base10ABC conjecture
3) Find generalized Fermat primes (Yves' GFN search)
4) Find/prove Smoothly Undulating Palindromic Primes
5) Find a very large prime quadruplet (>2000 digits)
6) Find _5_ titanic primes in arithmetic progression
7) Find a gap between consecutive primes with a D>33
8) Find palindromic primes which include many zeroes
So I am working on 2^4 or 16* different prime projects at this
time. And every single one is a longterm project, which means
that it has been worked on for more than half a year (actually
four of them more than one year).
I'm really curious about what all the members of this list are
hunting for *at the very moment*. The number of projects alone
should be immense, but the kind of projects might surprise us.
Hans
PS: The numbering of my projects does not indicate the priority
of them. *So I am working on 2^4 or 16 different prime projects
since each of my projects is usually followed by a subproject.  Does factoring count?
Some of us are working on factoring numbers
in the RSA challenge list with >200 digits.
Milton L. Brown
miltbrown@...
 Original Message 
From: <Hans.Rosenthal@...>
To: "Prime numbers group" <primenumbers@yahoogroups.com>
Sent: Wednesday, February 27, 2002 4:03 PM
Subject: [PrimeNumbers] Computational prime projects
> We count 351 members on this prime numbers list at the moment.
> I was wondering how many and what prime project(s) they follow
> at present. I counted all my prime projects together and I got
>
> 1) Find primes k*720^n+1 with n=1..open and k=2..719
> 2) Find a counterexample for my base10ABC conjecture
> 3) Find generalized Fermat primes (Yves' GFN search)
> 4) Find/prove Smoothly Undulating Palindromic Primes
> 5) Find a very large prime quadruplet (>2000 digits)
> 6) Find _5_ titanic primes in arithmetic progression
> 7) Find a gap between consecutive primes with a D>33
> 8) Find palindromic primes which include many zeroes
>
> So I am working on 2^4 or 16* different prime projects at this
> time. And every single one is a longterm project, which means
> that it has been worked on for more than half a year (actually
> four of them more than one year).
>
> I'm really curious about what all the members of this list are
> hunting for *at the very moment*. The number of projects alone
> should be immense, but the kind of projects might surprise us.
>
> Hans
>
> PS: The numbering of my projects does not indicate the priority
> of them. *So I am working on 2^4 or 16 different prime projects
> since each of my projects is usually followed by a subproject.
>
>
> Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> The Prime Pages : http://www.primepages.org
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>  At 04:13 PM 2/27/2002 0800, Milton Brown wrote:
>Does factoring count?
And others are working on educating the group with regard to the need for
>
>Some of us are working on factoring numbers
>in the RSA challenge list with >200 digits.
reproducability and verifiability in scientific results.
Nathan  And, exactly what do you mean?
Please give us an example of your "education"
 Original Message 
From: "Nathan Russell" <nrussell@...>
To: "Milton Brown" <miltbrown@...>; "Prime numbers group"
<primenumbers@yahoogroups.com>; <Hans.Rosenthal@...>
Sent: Wednesday, February 27, 2002 5:51 PM
Subject: Re: [PrimeNumbers] Computational prime projects
> At 04:13 PM 2/27/2002 0800, Milton Brown wrote:
> >Does factoring count?
> >
> >Some of us are working on factoring numbers
> >in the RSA challenge list with >200 digits.
>
> And others are working on educating the group with regard to the need for
> reproducability and verifiability in scientific results.
>
> Nathan
>
>
>
> Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> The Prime Pages : http://www.primepages.org
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>   Hans.Rosenthal@... wrote:
> We count 351 members on this prime numbers list at the moment.
1) Presieving GFN numbers for Yves' GFN project
> I was wondering how many and what prime project(s) they follow
> at present.
2) Something to do with small numbers, with Paul J.
3) Arithmetic Progression stuff with Arvind
4) Something secret, on my own.
5) Looking for a generalised fermat sequence with more than 5 initial
prime terms (on primepuzzles.net, they're fermatian primes)
6) Ooh, I did complete the 50005100 range, Hans, remind me to mail
you the results!
So that's 5.
Phil
=====

.sig selecter broken, please ignore.
__________________________________________________
Do You Yahoo!?
Yahoo! Greetings  Send FREE ecards for every occasion!
http://greetings.yahoo.com   In primenumbers@y..., Hans.Rosenthal@t... wrote:
> I'm really curious about what all the members of this list are
I'm newer to this group and a lightweight on number theory, but I am
> hunting for *at the very moment*. The number of projects alone
> should be immense, but the kind of projects might surprise us.
doing the following:
1) The Riesel Problem (from www.prothsearch.net).
2) Multifactorial primes (also from www.prothsearch.net). I hope
that Ray Ballinger updates his web site and adds a 'Reserve Range'
feature for primes of this form. It would also be nice if
NewPGen could sieve numbers of this form.
3) ECM factoring (on a Mac). I'm trying to port OpenPFGW to it,
but it is proving to be more difficult than I expected and my
skills don't seem to be up to the challenge.
I would bet that the Riesel and Sierpinski problems would be completed
with a year or two if they were incorporated into GIMPS or
distributed.net.
Mark  I'm working on the following:
Puzzle 10 from the prime puzzles connection, namely is there always a prime
of the form k*n#+/1 or n#/k+/1. I've checked to n=1003.
n!2+1currently to 26497, prime for 1,2,518.
k*2^(2^171)1 to 10000000.
Sierpinski base 146561, cuurnetly to 447538.
n*(2^321)^4096+1 currentlyto 18040.
n!3+/1currently to 38000.
Carol & Kynea numbers currently to 41968.
Also Gallot's GFN project, & generalized woodalls.
sharvey@... harvey563@...
[Nontext portions of this message have been removed]  I am doing the fallowing projects:
1. Proth primes of the form k*2^n+1
2. GIMPS
3. GFN search
4. Primes of the form k*2^n1 for 301<k<999
5. Primes of the form n!1
6. 15factorial primes.
7. Fermat numbers factoring
8. x^y*y^x for 1<x<y<101 factorisation
Marcin Original Message 
From: Hans.Rosenthal@...
To: Prime numbers group
Sent: Thursday, February 28, 2002 1:03 AM
Subject: [PrimeNumbers] Computational prime projects
We count 351 members on this prime numbers list at the moment.
I was wondering how many and what prime project(s) they follow
at present. I counted all my prime projects together and I got
1) Find primes k*720^n+1 with n=1..open and k=2..719
2) Find a counterexample for my base10ABC conjecture
3) Find generalized Fermat primes (Yves' GFN search)
4) Find/prove Smoothly Undulating Palindromic Primes
5) Find a very large prime quadruplet (>2000 digits)
6) Find _5_ titanic primes in arithmetic progression
7) Find a gap between consecutive primes with a D>33
8) Find palindromic primes which include many zeroes
So I am working on 2^4 or 16* different prime projects at this
time. And every single one is a longterm project, which means
that it has been worked on for more than half a year (actually
four of them more than one year).
I'm really curious about what all the members of this list are
hunting for *at the very moment*. The number of projects alone
should be immense, but the kind of projects might surprise us.
Hans
PS: The numbering of my projects does not indicate the priority
of them. *So I am working on 2^4 or 16 different prime projects
since each of my projects is usually followed by a subproject.
Yahoo! Groups Sponsor
ADVERTISEMENT
Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
The Prime Pages : http://www.primepages.org
Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.
[Nontext portions of this message have been removed] > We count 351 members on this prime numbers list at the moment.
1) Searching for PRPs of the form x^y+y^x.
> I was wondering how many and what prime project(s) they follow
> at present. I counted all my prime projects together and I got
2) Sundry factoring projects with ECM, MPQS and NFS.
Paul> > We count 351 members on this prime numbers list at the moment.
1) Studying properties of primes of the form (a+1)^p  a^p
>> I was wondering how many and what prime project(s) they follow
> > at present. I counted all my prime projects together and I got
2) Looking at the chromatic polynomials of cyclic graphs with p+1
nodes (p prime).> I would bet that the Riesel and Sierpinski problems
:o))
> would be completed with a year or two if they were
> incorporated into GIMPS or distributed.net.
Read http://perso.wanadoo.fr/yves.gallot/papers/weight.html
Today, the programs are "just" able to test some numbers between 10^6 and
10^7 digits. They are really too small for the solution of Sierpinski and
Riesel problems.
We have a 50% chance of solving Sierpinski problem with a 10^12 digits
prime. We have a 50% chance of solving Riesel problem with a 10^20 digits
prime. If no mathematical proof is found, I would bet that the Sierpinski
will be completed in about one century and the Riesel problem in about a
millenium.
Yves> > We count 351 members on this prime numbers list at the moment.
1) Joe McLean's BallingerKeller search, on a 333MHz P2,
> > I was wondering how many and what prime project(s) they follow
> > at present. I counted all my prime projects together and I got
coexisting with my daytoday personal computer use.
2) Joe McLean's BallingerKeller search, on about an 850MHz
P3 laptop, full time dedicated. Oh, not baseless attacks by in innuendo!
Then, I have learned:
Education means one thing to some people
and something entirely different to others.
 Original Message 
From: "Christian Boyer" <cboyer@...>
To: "Milton Brown" <miltbrown@...>
Cc: "Nathan Russell" <nrussell@...>
Sent: Thursday, February 28, 2002 3:05 AM
Subject: RE: [PrimeNumbers] Computational prime projects
> Milton,
>
> Education means : answer to asked questions.
> Or at least : explain why you can't answer.
>
> Christian Boyer.
>
> > Message d'origine
> > De: Milton Brown [mailto:miltbrown@...]
> > Date: jeudi 28 février 2002 03:51
> > À: Prime numbers group; Hans.Rosenthal@...; Nathan Russell
> > Objet: Re: [PrimeNumbers] Computational prime projects
> >
> >
> > And, exactly what do you mean?
> >
> > Please give us an example of your "education"
> >
> >  Original Message 
> > From: "Nathan Russell" <nrussell@...>
> > To: "Milton Brown" <miltbrown@...>; "Prime numbers group"
> > <primenumbers@yahoogroups.com>; <Hans.Rosenthal@...>
> > Sent: Wednesday, February 27, 2002 5:51 PM
> > Subject: Re: [PrimeNumbers] Computational prime projects
> >
> >
> > > At 04:13 PM 2/27/2002 0800, Milton Brown wrote:
> > > >Does factoring count?
> > > >
> > > >Some of us are working on factoring numbers
> > > >in the RSA challenge list with >200 digits.
> > >
> > > And others are working on educating the group with regard to
> > the need for
> > > reproducability and verifiability in scientific results.
> > >
> > > Nathan
> > >
> > >
> > >
> > > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > > The Prime Pages : http://www.primepages.org
> > >
> > >
> > >
> > > Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
> >
> >
>
>
>
> Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> The Prime Pages : http://www.primepages.org
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
> > > > We count 351 members on this prime numbers list at the moment.
1) finish 100000 NRD search (current)
> >> I was wondering how many and what prime project(s) they follow
> > > at present. I counted all my prime projects together and I got
2) find prime 2^(2^191)2^(2^18+k)+1
4) 2PRP 2^n2^k1 for 0<k<44<n<100000
3) help find Carol/Kynea Primes
4) compute f=x^3+x^21,f=x^3+x1 for all x<10^8 checking fx^fx =>
f is prime
5) extend 4) to higher powers
Paul> > We count 351 members on this prime numbers list at the moment.
1.) Search for a factor of the double Mersenne Number MM61 (some PCs with about 5000 MHz in sum)
> > I was wondering how many and what prime project(s) they follow
> > at present.
http://www.ltkz.demon.co.uk/ar2/mm61prog.htm
2.) Finding a Proth prime of the form 5*2^n + 1, and possible a new largest known composite Fermat number ( currently n: 11000001200000, 34 * PIII/933 MHz)
http://www.prothsearch.net/guestbook.html
3.) Search for GFPrimes with n=65536 and 131072 ( 18 * PIII/933 MHz)
http://perso.wanadoo.fr/yves.gallot/primes/status.html
All PCs are running 24h/day, 7d/week.
"There are lots of idle cpucycles to spare, and I'm investing them in science"
Cheers !

Manfred Toplic Huuuuumpf!
1 p3866, GFN...
# De : Toplic Manfred GSK SD [mailto:ToplicM@...]
[...]
# (some PCs with about 5000 MHz in sum)
[...]
# 34 * PIII/933 MHz
[...]
# ( 18 * PIII/933 MHz)
[Nontext portions of this message have been removed]  Yet another definition!
 Original Message 
From: "Christian Boyer" <cboyer@...>
To: "Milton Brown" <miltbrown@...>
Sent: Thursday, February 28, 2002 3:05 PM
Subject: RE: [PrimeNumbers] Computational prime projects
> My dear Milton,
>
> Education means also keep offlist a message initially sent offlist !
>
> Christian Boyer.
>
> > Message d'origine
> > De: Milton Brown [mailto:miltbrown@...]
> > Date: jeudi 28 février 2002 18:20
> > À: Christian Boyer; primenumbers@yahoogroups.com
> > Cc: Nathan Russell
> > Objet: Re: [PrimeNumbers] Computational prime projects
> >
> >
> > Oh, not baseless attacks by in innuendo!
> >
> > Then, I have learned:
> >
> > Education means one thing to some people
> > and something entirely different to others.
> >
> >
> >  Original Message 
> > From: "Christian Boyer" <cboyer@...>
> > To: "Milton Brown" <miltbrown@...>
> > Cc: "Nathan Russell" <nrussell@...>
> > Sent: Thursday, February 28, 2002 3:05 AM
> > Subject: RE: [PrimeNumbers] Computational prime projects
> >
> >
> > > Milton,
> > >
> > > Education means : answer to asked questions.
> > > Or at least : explain why you can't answer.
> > >
> > > Christian Boyer.
> > >
> > > > Message d'origine
> > > > De: Milton Brown [mailto:miltbrown@...]
> > > > Date: jeudi 28 février 2002 03:51
> > > > À: Prime numbers group; Hans.Rosenthal@...; Nathan Russell
> > > > Objet: Re: [PrimeNumbers] Computational prime projects
> > > >
> > > >
> > > > And, exactly what do you mean?
> > > >
> > > > Please give us an example of your "education"
> > > >
> > > >  Original Message 
> > > > From: "Nathan Russell" <nrussell@...>
> > > > To: "Milton Brown" <miltbrown@...>; "Prime numbers group"
> > > > <primenumbers@yahoogroups.com>; <Hans.Rosenthal@...>
> > > > Sent: Wednesday, February 27, 2002 5:51 PM
> > > > Subject: Re: [PrimeNumbers] Computational prime projects
> > > >
> > > >
> > > > > At 04:13 PM 2/27/2002 0800, Milton Brown wrote:
> > > > > >Does factoring count?
> > > > > >
> > > > > >Some of us are working on factoring numbers
> > > > > >in the RSA challenge list with >200 digits.
> > > > >
> > > > > And others are working on educating the group with regard to
> > > > the need for
> > > > > reproducability and verifiability in scientific results.
> > > > >
> > > > > Nathan
> > > > >
> > > > >
> > > > >
> > > > > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > > > > The Prime Pages : http://www.primepages.org
> > > > >
> > > > >
> > > > >
> > > > > Your use of Yahoo! Groups is subject to
> > > http://docs.yahoo.com/info/terms/
> > > >
> > > >
> > >
> > >
> > >
> > > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > > The Prime Pages : http://www.primepages.org
> > >
> > >
> > >
> > > Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
> >
> >
>
>
>
> Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> The Prime Pages : http://www.primepages.org
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>  Milton, your other name is perhaps Mister Bean ?
C. Boyer.
(to members of this list :
be happy, this message is my LAST message sent offlist or not to our
famous Milton !)
> Message d'origine
http://docs.yahoo.com/info/terms/
> De: Milton Brown [mailto:miltbrown@...]
> Date: vendredi 1 mars 2002 15:28
> À: Christian Boyer; primenumbers@yahoogroups.com
> Objet: Re: [PrimeNumbers] Computational prime projects
>
>
> Yet another definition!
>  Original Message 
> From: "Christian Boyer" <cboyer@...>
> To: "Milton Brown" <miltbrown@...>
> Sent: Thursday, February 28, 2002 3:05 PM
> Subject: RE: [PrimeNumbers] Computational prime projects
>
>
> > My dear Milton,
> >
> > Education means also keep offlist a message initially sent offlist !
> >
> > Christian Boyer.
> >
> > > Message d'origine
> > > De: Milton Brown [mailto:miltbrown@...]
> > > Date: jeudi 28 février 2002 18:20
> > > À: Christian Boyer; primenumbers@yahoogroups.com
> > > Cc: Nathan Russell
> > > Objet: Re: [PrimeNumbers] Computational prime projects
> > >
> > >
> > > Oh, not baseless attacks by in innuendo!
> > >
> > > Then, I have learned:
> > >
> > > Education means one thing to some people
> > > and something entirely different to others.
> > >
> > >
> > >  Original Message 
> > > From: "Christian Boyer" <cboyer@...>
> > > To: "Milton Brown" <miltbrown@...>
> > > Cc: "Nathan Russell" <nrussell@...>
> > > Sent: Thursday, February 28, 2002 3:05 AM
> > > Subject: RE: [PrimeNumbers] Computational prime projects
> > >
> > >
> > > > Milton,
> > > >
> > > > Education means : answer to asked questions.
> > > > Or at least : explain why you can't answer.
> > > >
> > > > Christian Boyer.
> > > >
> > > > > Message d'origine
> > > > > De: Milton Brown [mailto:miltbrown@...]
> > > > > Date: jeudi 28 février 2002 03:51
> > > > > À: Prime numbers group; Hans.Rosenthal@...; Nathan Russell
> > > > > Objet: Re: [PrimeNumbers] Computational prime projects
> > > > >
> > > > >
> > > > > And, exactly what do you mean?
> > > > >
> > > > > Please give us an example of your "education"
> > > > >
> > > > >  Original Message 
> > > > > From: "Nathan Russell" <nrussell@...>
> > > > > To: "Milton Brown" <miltbrown@...>; "Prime
> numbers group"
> > > > > <primenumbers@yahoogroups.com>; <Hans.Rosenthal@...>
> > > > > Sent: Wednesday, February 27, 2002 5:51 PM
> > > > > Subject: Re: [PrimeNumbers] Computational prime projects
> > > > >
> > > > >
> > > > > > At 04:13 PM 2/27/2002 0800, Milton Brown wrote:
> > > > > > >Does factoring count?
> > > > > > >
> > > > > > >Some of us are working on factoring numbers
> > > > > > >in the RSA challenge list with >200 digits.
> > > > > >
> > > > > > And others are working on educating the group with regard to
> > > > > the need for
> > > > > > reproducability and verifiability in scientific results.
> > > > > >
> > > > > > Nathan
> > > > > >
> > > > > >
> > > > > >
> > > > > > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > > > > > The Prime Pages : http://www.primepages.org
> > > > > >
> > > > > >
> > > > > >
> > > > > > Your use of Yahoo! Groups is subject to
> > > > http://docs.yahoo.com/info/terms/
> > > > >
> > > > >
> > > >
> > > >
> > > >
> > > > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > > > The Prime Pages : http://www.primepages.org
> > > >
> > > >
> > > >
> > > > Your use of Yahoo! Groups is subject to
> > http://docs.yahoo.com/info/terms/
> > >
> > >
> >
> >
> >
> > Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
> > The Prime Pages : http://www.primepages.org
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
>
Unsubscribe by an email to: primenumbersunsubscribe@egroups.com
>
The Prime Pages : http://www.primepages.org
Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/  My ambitions are:
1) to learn (or invent) some new theory in each new project
2) to get out [*] of Chris's top200byProthcycles
3) to stay in Chris's top10bynumbers
So it's difficult to know what to do next.
Suggestions, consistent with these desiderata,
are always welcome.
David
[*] To my shame, I am still there, at number 199.   In primenumbers@y..., Hans.Rosenthal@t... wrote:
> We count 351 members on this prime numbers list at the moment.
[...]
> I was wondering how many and what prime project(s) they follow
> at present.
> I'm really curious about what all the members of this list are
I'm working in making a Java applet to factor as fast as possible, so
> hunting for *at the very moment*. The number of projects alone
> should be immense, but the kind of projects might surprise us.
>
> Hans
>
it can be used by the general people on Internet. I implemented the
algorithms ECM and SIQS.
Its Web address is:
http://www.alpertron.com.ar/ECM.HTM
The source code is available in the same page.
In order to test the applet, I used it to factor a 80digit composite
= P40 x P41 where:
P40 = (2^132  187)/3
P41 = 2^133  99
The computation took 2d 8h 57m 34s in a Celeron 566 MHz. The linear
algebra phase, using the Block Lanczos algorithm on a sparse binary
matrix of 26038 x 27379, took only 3m 30s.
There are several other people that are using the applet. See for
example the hunt for the factors of partition numbers P(n) at:
http://www.asahinet.or.jp/~KC2HMSM/mathland/part/whatsnew.htm
where Tom Hill is using the applet to find the factors.
Best regards,
Dario Alejandro Alpern
Buenos Aires  Argentina
http://www.alpertron.com.ar/ENGLISH.HTM  Dario Alejandro Alpern wrote:
> P40 = (2^132  187)/3
For comparison, Satoshi Tomabechi's SIQS took 100 minutes
> P41 = 2^133  99
> The computation took 2d 8h 57m 34s in a Celeron 566 MHz.
for this c80
> P39 = 739315861231459207946328658956357714871
on a 1 GHz Athlon.
> P41 = 28353250219820203329613565398475280567239
> cputime 1:39:24:52
Still, it is great that you put your multimethod applet
on the web, Dario. To combine userfriendliness,
open source, web access, and decent speed is fine
service. Thanks for your work!
David
Your message has been successfully submitted and would be delivered to recipients shortly.