+- HP Forums (https://www.hpmuseum.org/forum)
+-- Forum: HP Calculators (and very old HP Computers) (/forum-3.html)
+--- Forum: General Forum (/forum-4.html)
+--- Thread: HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers (Amended) (/thread-13411.html)
HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers (Amended) - Gerald H - 08-04-2019 07:53 AM
The previous version of this thread
https://www.hpmuseum.org/forum/thread-10026.html?highlight=palindrom
ended with the reference to
https://arxiv.org/abs/1602.06208
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.
RE: HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers-Amended - Gerald H - 09-01-2019 03:33 PM
Amendment is the inclusion of the clause in bold in the original post.