### Search

 Search WWW Search DelphiForFun.org

As of October, 2016, Embarcadero is offering a free release of Delphi (Delphi 10.1 Berlin Starter Edition ).     There are a few restrictions, but it is a welcome step toward making more programmers aware of the joys of Delphi.  They do say "Offer may be withdrawn at any time", so don't delay if you want to check it out.  Please use the feedback link to let me know if the link stops working.

Support DFF - Shop

If you shop at Amazon anyway,  consider using this link.

We receive a few cents from each purchase.  Thanks

### Support DFF - Donate

If you benefit from the website,  in terms of knowledge, entertainment value, or something otherwise useful, consider making a donation via PayPal  to help defray the costs.  (No PayPal account necessary to donate via credit card.)  Transaction is secure.

Mensa® Daily Puzzlers

For over 15 years Mensa Page-A-Day calendars have provided several puzzles a year for my programming pleasure.  Coding "solvers" is most fun, but many programs also allow user solving, convenient for "fill in the blanks" type.  Below are Amazon  links to the two most recent years.

(Hint: If you can wait, current year calendars are usually on sale in January.)

### Contact

 Search DelphiForFun.org only

### Problem Description

This program investigates Euler's Sum of Powers Conjecture looking especially for counterexamples which prove the conjecture untrue.

### Notes for Programmers

For efficiency the search is driven with a table containing the specified power values of the specified maximum value to be searched. This makes generating variable candidates very fast, the Nth power of N is located at Table[n].  Checking whether a sum is also in the table is slower, the program currently searches sequentially from the highest final root variable index + 1 until we reach the end of the table or a table entry greater than or equal to the sum being checked.   If the entry is equal, we have a solution.

### Suggestions for Further Explorations

 Optimize check for solution (binary search?).  Keep table in a TIntlist? Implement the Lander-Parkin Algorithm to speed  searches for counterexamples.

 Original Date: July 23, 2013 Modified: July 29, 2017