Distributed Beal Conjecture Problem - Page 2

R.D. Silverman · 2009-04-20, 16:29

Quote:

Originally Posted by Joshua2

What should I call it, because I have to call it something. I guess "An Extension of FLT"? What would you advise me to spend some time writing a program on? I figure it wouldn't be too bad to verify Beal Conjecture on small exponents where a solution is most likely to exist (which may or not have coprime bases) with bases up to something reasonable like 1 million. They have only been checked exp to 7 and bases to 250k, so it wouldn't take too much cpu time. If that doesn't work I plan on going to another project myself.

Any ideas? I was writing a program to find prime numbers using a sieve, but that is not really any use. I wrote a program to try and find a counterexample to the fortunate conjecture, but that took a lot of cpu time.

We have to call it the "Beal Conjecture", because there is no alternative
name that stands out, but I don't like it. Beal isn't even a mathematician.

If you are looking to write code that is actually going to settle some
open conjecture, I doubt whether it is doable within the time horizon
of a senior thesis. All of the current "well-known" conjectures have
already been pounded into the sand. I would check R. Guy's
"Unsolved Problems in Number Theory" and try one that hits my fancy.

CRGreathouse · 2009-04-20, 18:51

I think it's a fine topic for an undergraduate paper. Learning the math to optimize the program is enough work already!

cheesehead · 2009-04-20, 21:56

Quote:

Originally Posted by R.D. Silverman

We have to call it the "Beal Conjecture", because there is no alternative name that stands out, but I don't like it.

Mathworld claims, at http://mathworld.wolfram.com/BealsConjecture.html

Quote:

Originally Posted by Mathworld

This conjecture is more properly known as the Tijdeman-Zagier conjecture (Elkies 2007).

. . .

Elkies, N. "The ABCs of Number Theory." Harvard Math. Rev. 1, 64-76, 2007.

T.Rex · 2009-04-20, 22:25

Quote:

Originally Posted by Joshua2

I bet it could be run on wine. I have c# code, which I believe is not compilable on linux. I plan to rewrite my program into java as practice to learn java. I think linux can run that, at least macs can.

?? Java ?? When you want a very efficient program for Math, you use either C or/and assembler, I think. Not Java... Strange idea...

Joshua2 · 2009-04-21, 15:16

I'll think about mono. I might make a 32 bit version in the future as well. Thanks to those who have volunteered if I get linux or 32 bit :).

henryzz · 2009-04-22, 13:50

linux can run .net(includes c#) programs if they have mono installed
just type:
mono xxxxx.exe
i dont know about speed though

Joshua2 · 2009-04-23, 02:17

ok, I don't have linux, but if anyone has it they are free to try it and let me know. I guess there is nothing I have to do on my end for mono? I wonder how mono compares to wine.

CRGreathouse · 2009-04-23, 02:27

Quote:

Originally Posted by Joshua2

I wonder how mono compares to wine.

Entirely different. WINE is essentially a Windows emulator (despite the name!), while Mono is just a port of the .NET framework to Linux.

Joshua2 · 2009-04-23, 03:05

I know that, I was wondering about the relatives speed. The mono should be a bit faster it seems.

CRGreathouse · 2009-04-23, 03:20

I wasn't able to run the executable with mono in Xubuntu.

Joshua2 · 2009-04-23, 03:39

Any error? It doesn't run in win 32 with a memory error. Did you run it with the three extensions it needs? In win it is "bealconjecture.exe 4 1 1000"

2009-04-21, 15:16	#16
Joshua2 Sep 2004 13×41 Posts	I'll think about mono. I might make a 32 bit version in the future as well. Thanks to those who have volunteered if I get linux or 32 bit :). Last fiddled with by Joshua2 on 2009-04-21 at 15:16

2009-04-22, 13:50	#17
henryzz Just call me Henry "David" Sep 2007 Liverpool (GMT/BST) 37·163 Posts	linux can run .net(includes c#) programs if they have mono installed just type: mono xxxxx.exe i dont know about speed though Last fiddled with by henryzz on 2009-04-22 at 13:51

2009-04-23, 03:39	#22
Joshua2 Sep 2004 13·41 Posts	Any error? It doesn't run in win 32 with a memory error. Did you run it with the three extensions it needs? In win it is "bealconjecture.exe 4 1 1000" Last fiddled with by Joshua2 on 2009-04-23 at 03:43

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
The Beal Conjecture Proof	Arxenar	Miscellaneous Math	1	2013-09-07 09:59
Distributed NFS postprocessing	poily	Msieve	6	2012-12-05 12:45
New Beal Conjecture Search	Joshua2	Open Projects	0	2009-04-20 06:58
distributed.net completes OGR-25	ixfd64	Lounge	4	2008-11-22 01:59
distributed proofreading	adpowers	Lounge	10	2004-11-05 01:54

2009-04-20, 18:51	#13
CRGreathouse Aug 2006 5,987 Posts	I think it's a fine topic for an undergraduate paper. Learning the math to optimize the program is enough work already!

2009-04-23, 02:17	#18
Joshua2 Sep 2004 13×41 Posts	ok, I don't have linux, but if anyone has it they are free to try it and let me know. I guess there is nothing I have to do on my end for mono? I wonder how mono compares to wine.

2009-04-23, 03:05	#20
Joshua2 Sep 2004 215₁₆ Posts	I know that, I was wondering about the relatives speed. The mono should be a bit faster it seems.

2009-04-23, 03:20	#21
CRGreathouse Aug 2006 1011101100011₂ Posts	I wasn't able to run the executable with mono in Xubuntu.