HP Forums

Full Version: HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers (Amended)
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
The previous version of this thread


ended with the reference to


providing proof & an algorithm for producing a maximally 3 palindromic integer partition of any integer.

I believe the suggested algorithm is uneconomic & could be replaced by a much more efficient process.

Consequently a challenge:

To find a simpler algorithm or use the algorithm above & programme implementation for the 50g.

Earliest posted correct algorithm & programme wins.
Amendment is the inclusion of the clause in bold in the original post.
Reference URL's