First, download the latest version.
Then unzip the program in a folder, run it, and enter the menu Test/User Information.
Type in your dedicated informations, and choose the type of connection.
Then click on Test/Enter EulerNet, let the power to 0, and if your computer is fast and not always connected to the Internet, put 64 or more instead of 32.

When you'll get connected to the Internet, you'll receive some ranges and all the transfers are automated. You'll get the credits for every computation you could do.

The server is hosted by Greg Childers (THANKS !!)

Good luck !

09/30/2002: Euler2000 version 4.21b
What's new:
- the server now accepts 5 connections simultaneously
- all assigned ranges are now resent by the server to the client. No more work can be lost !
- Euler2000 automatically changes the server address to the new domain

09/22/2002: Euler2000 version 4.20

What's new:
- improved the accuracy of the time counters
- removed the game and some old Resta's programs (100Kb saved !)
- the worktodo file is now sorted when starting a new computation. This will speedup the search on small ranges !
(Suggested by Laurent Lucas)
- added some protections on the server side, so that nobody could reserve more than 100 ranges

09/15/2002: Euler2000 version 4.19

What's new:
- fixed a crash when computing (6,2,5) above 58385. This was a simple overflow.
Thanks to Kirk Pearson for being the first to report it !

08/27/2000: Euler2000 version 4.18

What's new:
 - fixed a huge bug if you used the Enter EulerNet more than once !!!
 - finally (?) fixed bug on Depth= hidden function
 - changed the Status display so that more information is displayed
 - now, entering EuletNet forces the connection (suggested by Laurent Lucas)
 - improved error control and messages
 - added automatic proxy detection
 - Euler2000 opens the USER INFORMATION box when run for the first time
 - added a Resta solution checker, now the solution will be displayed correctly !!
 - changed the MacLean depth to MacLean duration
 - added Resta (8,1,7) (8,3,5) (10,1,12) (10,4,10) (10,5,8) and (10,5,9) !!!
  (due to the discoveries by Scott I. Chase)
 - removed the counters on Resta's algorithm
 - Euler2000 opens the Enter EulerNet dialog box when we select a new type of dialup
 - added Prime Search for Carlos Rivera (

07/23/2000: Euler2000 version 4.17

07/20/2000: Euler2000 version 4.16

07/02/2000: Euler2000 beta 15

07/17/1999: New version 3.3c

04/14/1999: New version 2.0a

If you are interested in breaking numerical records, you have to mail to <> to reserve a range, please specify which equation you'd like to explore (to avoid duplicate work).
Go to the progress page to choose the equation.

When you'll receive your range, you need to download Sum95.
Then you have to unzip it into a specific directory (use Pkunzip, Gzip or WinZip).

Go to the Options menu, and click on Install, so Sum95 will start automatically at Windows boot.
Then enter your range in Sum95, and the computation will start.

Good luck !

Note: Sum95 has no floating point routines, so it should perform quite well on any kind of processor (AMD, Cyrix or 486).

Important note:

The current version of Sum95 is not very well suited to the powers lower than 8.
A new version, which will handle the computations slightly faster on these powers, will be available in some weeks.


Future plans:
 - Internet client/server
 - improvement of odd powers (especially 5, 7 and 9)
 - rewriting of the interface without using MFC

Version 3.3c (17 July 1999):
 - now, Sum99 correctly saves its computations on 5 5 search each xx minutes
Version 3.3b (14 July 1999):
 - corrected 2 bugs in 5 5 search in saved files
Version 3.3a (13 July 1999):
 - corrected bug: types in 5 5 search could not be above 9
Version 3.3 (12 July 1999):
 - saved files are much shorter for 5 5 search !
 - ForceAVL flag added for Chen Shuwen
 - added 10 more 5 5 search types !
Version 3.1 (21 June 1999):
 - improved (k,m,n) with k even and m >= 2
 - added more Scher's routines to search for 5 5
Version 3.0 beta 4 (10 June 1999)
 - faster (6,m,n) (8,m,n) and in general (k,m,n) with k even and n low
 - faster AVL on certain cases
Version 2.0a (14 April 1999):
 - improved computation speed on (k,1,n) with k even
 - corrected a bug that affected computations above 16,893 (thanks to Nuutti Kuosa)
 - computations on 512 bits are now possible !

Version 2 beta 5 (10 April 1999):
 - added a lot of new functions (AVL computation, modular restrictions and memory reductions)

Sources version 1.4a (21 February 1999):
Version 1.4a (16 February 1999):
 - corrected 2 bugs
Version 1.4 (15 February 1999):
 - changed filenames (for DOS compatibility)
 - added NoSave capability
 - added total time
 - corrected multiple Install/Uninstall on the same computer
 - corrected memory leaks in INI code
 - little bugs corrected
 - improved status display
Version 1.3 (7 February 1999):
 - 1024 bits calculation
 - added install/uninstall option
 - assembly sources Masm and Tasm compatible
 - some little bugs removed
 - added timed search
Version 1.2 (23 January 1999):
 - faster program for m>1
 - french LISEZMOI.TXT
- corrected icons
- added Cpu detection and cycle timing
- reduced the EXE file
Assembly source available (17 January 1999):
- main computation routine
Version 1.1a (17 January 1999):
 - 128 bits computation added
 - .BAK
 - we can now decrease the number of right terms in WORKSUM.INI
 - better display
 - icons corrected
Version 1.1 (13 January 1999):
 - 96 bits computation added
 - changed the saving of the files
 - changed the status display
Version 1.0b (10 January 1999):
 - signature on each output line added
 - preferences/priority added
 - automatic saving/display added
 - saved filename changed (so we can do multiple search on the same power)
Version 1.0a (6 January 1999):
 - bug correction in loadfile
Version 1.0 (3 January 1999):
 - initial release

Go to the index page