1) What is the goal of the search ?

In 1967, Lander and Parkin found a fifth power equal to FOUR fifth powers : 1445=1335+1105+845+275
They also found a sixth power equal to SEVEN sixth powers: 11416=10776+8946+7026+4746+4026+2346+746

We are trying to find a sixth power that is equal to SIX sixth powers.

When we will find a sixth power that is equal to six sixth powers, we will start searching a sixth power that is equal to five sixth powers !

2) How can I install Euler2000 ?

First, download the zip file, extract it into a specific directory.

At the first run, Euler2000 will detect your processor and will install itself.
Then the program will run in the background taking all idle processor time.
This means that your applications won't slow due to its use, except if you have not enough memory.

3) How can I join EulerNet ?

Go to the menu Test/User Information.
Enter your name/email/team name/password (everything is optional here).

Then click on the type of connection you have.
If you have a modem, click on Dial-up connection, and if you have a permanent access, choose Network connection.
Then click OK.

Now, go to the menu Test/Enter EulerNet, and choose the type of work (currently, only 6th power is available).
Enter the amount of work you'd like. If you have a permanent access, let the default value.
If you have a dialup connection, and you are connected every day, I recommend you the value 16.
If you are connected less regularly, you'll better reserve 64 ranges or more.
BEWARE ! There is a small bug in version 4.21b, which allows you to assign more than 100 ranges !
The server CANNOT assign more than 100 workunits to every user.

The server is port 21. It is hosted by Greg Childers.

4) How can I join or create a team ?

Setting up a team is really easy. When you enter your user information, simply enter your Team Name, and all your computation time will be credited to this team (and also to you, as an individual). If you change the Team Name, all your credits change of team too ! Password is used only to avoid credit stealing, so you don't need to give it to your team.

5) What is the minimal configuration for running Euler2000 ?

It runs pretty well on any Pentium-like, but I strongly recommend that you have more than 32 megabytes (currently, Euler2000 needs 16 megabytes to compute (6,1,6) but when we will reach 2,000,000, it will surely need 24 megabytes or more).
It's pretty slow on Athlon.

6) How can I force a connection to EulerNet ?

In the menu Test, click on Enter EulerNet, then click OK. All your work will be sent back to the server if you are connected to the Internet.
All your assigned work remains assigned to your computer for a period of 30 days. That means that when no result has been received after 30 days, the values are reassigned to another participant.

7) I'm getting Timeout errors, is this normal ?

Yes, in fact, the current behaviour of the server is that every connected participant has 60 seconds to send back all his work and to get his future tasks and check if the work-in-progress is correct. Since it's common that you need more than 64 ranges, it takes a lot of time to get all this work, so you'll get disconnected.
This behaviour of EulerNet will change very soon.

8) I get a 'proxy server does not support tunneling' and 'proxy authorization required', what does that mean ?

Well, in fact, it is a bug in Euler2000. For the moment, Euler2000 is unable to bypass proxies. Next version will solve the problem, but also, working on every new version is very time-consuming, so don't expect it soon :-(

9) I found a solution, but it doesn't seem correct. Is this a bug ?

No, in fact, the 'Resta' algorithm used in the search tries to divide the temporary sums to reduce the search time.

A recent example:

(6,1,7) 173905-166770-10322-1261-3103-2220-2083-83
(6,1,7) 173905-166770-10322-1261-3103-2083-83-740
(6,1,7) 173905-166770-10322-1261-3103-2220-2083-83
(6,1,7) 173905-166770-10322-1261-3103-2083-83-740

If you check the sums, you can verify that it doesn't sum to zero.

In fact, the solution found is:


And, yes, this solution has been found in four different ways.

(the first decomposition is: 173905-166770-10322*7-1261*21-3103*42-2220*42-2083*42-83*42)

10) I found a bug, what can I do ?

Simply report it to <>
I need your feedback to locate and fix the bugs, thanks !

For the moment, I'm aware of the following bugs:
 - if you are behind a password protected proxy, Euler2000 won't connect to EulerNet.
 - if the connection to the EulerNet server takes more than 2 minutes, you'll get a message indicating a time-out error.

11) I'm interested in helping, what can I do ?

Firstly, run the client.

Secondly, in finding a relation between all the current known solutions:


12) What practical applications have the minimal equal sums of like powers ?

We are not aware if this problem has a practical application. Currently, their only application is to improve the algorithms to solve such problems. If you find another utility, please mail us !

Go to the index page