mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Open Projects

Reply
 
Thread Tools
Old 2007-08-11, 03:41   #12
Citrix
 
Citrix's Avatar
 
Jun 2003

5·317 Posts
Default

This might make for some good short projects
http://www.recmath.org/contest/
We can donate the money to charity or distribute amongst users... whatever the users decide on....
Citrix is offline   Reply With Quote
Old 2007-12-17, 12:34   #13
Citrix
 
Citrix's Avatar
 
Jun 2003

5×317 Posts
Default Rules

Threads that are inactive for more than 2 weeks will be locked. If you want a thread opened PM me. This will help reduce the clutter.
Try to keep your project limited to 1-2 threads.

Last fiddled with by Citrix on 2007-12-17 at 12:48
Citrix is offline   Reply With Quote
Old 2007-12-17, 20:29   #14
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

22·32·293 Posts
Default

Quote:
Originally Posted by Citrix View Post
Threads that are inactive for more than 2 weeks will be locked. If you want a thread opened PM me. This will help reduce the clutter.
Try to keep your project limited to 1-2 threads.
Thanks for making "Sticky's" out of the "Conjectures 'R Us" effort, Citrix. I was going to ask for that today and you beat me to it!

I know we have 4-5 threads for the effort but it's potentially so large that I think we'll need them. Also Xyzzy indicated that we may get our own project forum at some point.


Thanks,
Gary
gd_barnes is online now   Reply With Quote
Old 2007-12-18, 21:01   #15
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

293416 Posts
Default

Quote:
Originally Posted by Citrix View Post
Threads that are inactive for more than 2 weeks will be locked. If you want a thread opened PM me. This will help reduce the clutter.
Try to keep your project limited to 1-2 threads.
Citrix,

You can now lock the Sierpinski bases 6 thru 18, base 10, base 22, and base 23 threads whenever you think it is appropriate.

About the "even k's and the Sierprinski and Riesel conjectures" threads. We'd want to keep those open for now. At the current time, I am not including any multiples of the bases in the conjectures searches. But within the next month, I plan to create a separate page just for k's that are multiples of the base but have a different lowest first primes for n>=1, i.e. 45*10^n-1 has a prime at n=1, but 450*10^n-1 doesn't have a prime until n=11958; so that is one that would be shown. k=4500 would not be shown because it has the same lowest prime as k=450. The same thing for 22*22^n+1, which has no prime at all, although 1*22^n+1 is prime for n=1.

The even k's and the Sierpinski and Riesel conjectures threads will fit right in with the 'multiples of the base' effort. If those aren't 'official prime search projects', I'll check with the folks in those threads and see if they are OK with including them in this effort.


Thanks,
Gary

Last fiddled with by gd_barnes on 2007-12-18 at 21:02
gd_barnes is online now   Reply With Quote
Old 2008-01-13, 06:20   #16
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

1101101100112 Posts
Default The "I Hate n=333,333" Project

Would anyone like to help me start an "I hate n=333,333" Project? Basically, the goal of this project is to find and prove primes bigger than about 100,365 digits, and submit them to Prime Pages. There is something very annoying to me about how boring the bottom of the top-5000 list looks.

Basically, we'd pick an n-value slightly above n=333,333, and try to knock all the n=333,333 primes off the list as quickly as possible.

Anybody interested?
jasong is offline   Reply With Quote
Old 2008-01-13, 08:31   #17
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

22·32·293 Posts
Default

Quote:
Originally Posted by jasong View Post
Would anyone like to help me start an "I hate n=333,333" Project? Basically, the goal of this project is to find and prove primes bigger than about 100,365 digits, and submit them to Prime Pages. There is something very annoying to me about how boring the bottom of the top-5000 list looks.

Basically, we'd pick an n-value slightly above n=333,333, and try to knock all the n=333,333 primes off the list as quickly as possible.

Anybody interested?
I feel similarly about the n=333333 primes and would love to knock all of them off.

I don't agree with fixed-n searches unless all k-values with primes are 'filled in' up to the n-value of the prime afterwords. Look for something big from me in less than 2 weeks that is not fixed-n but that will help with this. You'll know it when you see it.


Gary
gd_barnes is online now   Reply With Quote
Old 2008-01-13, 15:23   #18
axn
 
axn's Avatar
 
Jun 2003

5,179 Posts
Default

Quote:
Originally Posted by jasong View Post
Basically, we'd pick an n-value slightly above n=333,333, and try to knock all the n=333,333 primes off the list as quickly as possible
And then, once all the 333333 primes have been knocked off, you (or someone else) just turns around and start a "I hate n = whatever" thread? And so on and so forth?

You should think this thru so that you don't end up repeating history.
axn is online now   Reply With Quote
Old 2008-01-13, 16:28   #19
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

350710 Posts
Default

Quote:
Originally Posted by axn1 View Post
And then, once all the 333333 primes have been knocked off, you (or someone else) just turns around and start a "I hate n = whatever" thread? And so on and so forth?

You should think this thru so that you don't end up repeating history.
Yeah, I thought about commenting on this, I guess I should have gone with my gut. Basically, I'm thinking we would pick a small range, something that amounts to a year or two of LLR on one core when it's sieved to a sufficient depth. When that's done, simply move on to another number.
jasong is offline   Reply With Quote
Old 2008-01-18, 18:40   #20
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

141518 Posts
Default

Quote:
Originally Posted by jasong View Post
Yeah, I thought about commenting on this, I guess I should have gone with my gut. Basically, I'm thinking we would pick a small range, something that amounts to a year or two of LLR on one core when it's sieved to a sufficient depth. When that's done, simply move on to another number.
Or, you could just crunch for the Conjecture 'R Us project--it's pretty easy to find a prime there, and it won't be long before their second team drive is in top-5000 territory. Not to mention that you can help prove some conjectures while you're at it.
mdettweiler is offline   Reply With Quote
Old 2008-01-21, 20:03   #21
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

22·32·293 Posts
Default

Quote:
Originally Posted by jasong View Post
Would anyone like to help me start an "I hate n=333,333" Project? Basically, the goal of this project is to find and prove primes bigger than about 100,365 digits, and submit them to Prime Pages. There is something very annoying to me about how boring the bottom of the top-5000 list looks.

Basically, we'd pick an n-value slightly above n=333,333, and try to knock all the n=333,333 primes off the list as quickly as possible.

Anybody interested?

Jasong,

You HAVE your wish!! Now announcing the 'No Prime Left Behind' project. Time to take out many of those n=333333 primes in rapid succession and make the bottom of the top-5000 list look good again! Come join us here.


Gary
gd_barnes is online now   Reply With Quote
Old 2010-01-26, 09:04   #22
Joshua2
 
Joshua2's Avatar
 
Sep 2004

10258 Posts
Default

I would like to write code for something that would do something significant within a year. Any ideas? I thought maybe solving mancala with several different rule sets? Only one has been done.
Joshua2 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve mickfrancis Factoring 2 2016-05-06 08:13
Modern parameter choice for large 14e/small 15e projects VBCurtis Factoring 29 2016-02-12 20:45
Investigating Distributed Computing Projects wetfoot Homework Help 9 2010-04-18 20:51
Projects themaster Lounge 1 2007-12-07 02:56
Overview of DC Projects? scottsaxman Information & Answers 2 2004-08-11 02:37

All times are UTC. The time now is 11:19.


Sat Nov 27 11:19:27 UTC 2021 up 127 days, 5:48, 0 users, load averages: 1.75, 1.60, 1.27

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.