![]() |
![]() |
#1 |
Jun 2003
1,579 Posts |
![]()
There are several intresting puzzles/open problems on the internet that require some one to write some code and others to run it for a 1-2 months and the puzzle/open problem can be solved.
I would like to start/suggest such a forum where people can post such problems. If the problem is intresting, people can write some code and then others can run it. Most projects here will be small, basically finished in a few weeks. Here are a few examples of the kind of problems that can be attempted with very little computing power. http://www.mersenneforum.org/showthread.php?t=5866 http://www.mersenneforum.org/showthread.php?t=5630 http://www.mersenneforum.org/showthread.php?t=3474 Any thoughts ![]() ![]() Last fiddled with by Citrix on 2007-08-11 at 04:51 |
![]() |
![]() |
![]() |
#3 |
Sep 2005
127 Posts |
![]()
Citrix,
wrt your third thread quoted... It's easy to prove a^x-b^y = n [_any_ n] with slight modification of my FLT/Catalan reasoning. J |
![]() |
![]() |
![]() |
#4 |
"Jason Goatcher"
Mar 2005
3×7×167 Posts |
![]()
It obviously isn't a "small" project, but I just read in "Scientific America"(I think) that they would like to use computers to prove that there is no Sudoku puzzle with 16 numbers given that has a unique answer.
So far they've found one that has two unique answers, and they've proven it only takes 17 numbers to make a puzzle unique. But they've never found a unique puzzle with 16 numbers given. The article said it would take about 10,000 computer years to solve with present technology. |
![]() |
![]() |
![]() |
#5 |
Jun 2003
110001010112 Posts |
![]()
I don't think there are any easy solutions to this that can be found in 2-3 weeks on a few computers.
Last fiddled with by Citrix on 2006-05-28 at 22:41 |
![]() |
![]() |
![]() |
#6 | |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
29·367 Posts |
![]() Quote:
Surely, if the answer is unique there must be precisely one of them. One of us is missing something. ![]() Paul |
|
![]() |
![]() |
![]() |
#7 |
Jun 2003
1,579 Posts |
![]()
Aren't all solutions unique in themselves?
|
![]() |
![]() |
![]() |
#8 | |
Jun 2003
The Texas Hill Country
32·112 Posts |
![]() Quote:
I think that the difficulty is a typographic spelling error. Rather than unique, I think that it should be spelled distinct, or something like that. |
|
![]() |
![]() |
![]() |
#9 |
"Jason Goatcher"
Mar 2005
350710 Posts |
![]()
Since this thread has been resurrected by a link from another thread, I'd like to say, yes, it was a typographic error.
|
![]() |
![]() |
![]() |
#10 |
May 2003
7·13·17 Posts |
![]()
I'm surprised that there isn't a distributed project to solve the 7-piece endgame problem (or the 6-piece endgame problem with castling). [For chess.]
Last fiddled with by Zeta-Flux on 2007-08-10 at 15:41 |
![]() |
![]() |
![]() |
#11 |
Jun 2003
30538 Posts |
![]()
Is there a reference to this problem? Any code available?
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |