Post Reply 
HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers
08-04-2019, 07:53 AM
Post: #1
HP 50g: Programming Problem: Integer Partition in 3 Palindromic Integers
The previous version of this thread

https://www.hpmuseum.org/forum/thread-10...=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 & programme implementation for the 50g.

Earliest posted correct algorithm & programme wins.
Find all posts by this user
Quote this message in a reply
Post Reply 




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