HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers (Amended)

08042019, 07:53 AM
(This post was last modified: 09012019 03:31 PM by Gerald H.)
Post: #1




HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers (Amended)
The previous version of this thread
https://www.hpmuseum.org/forum/thread10...=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. 

09012019, 03:33 PM
Post: #2




RE: HP 50g: Programming Problem: Integer Partition in 3 Palindromic IntegersAmended
Amendment is the inclusion of the clause in bold in the original post.


« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)