Tripartite Palindromic Partition of Integer (HP 50g) Challenge

[2old2randr]

I have fixed all three problems reported by Gerald.

1. For 3000: there was a missing CASE clause in SML4 which caused the relevant code to never be executed (it got subsumed by a nested CASE). Fixed and PALIN now returns (2992, 7, 1).
2. For 1128097: There were a couple of typos in ALGO3 one of which was a missing "AND" in an IF...THEN causing the extraneous value on the stack. Fixed and PALIN now returns (1020201, 99899, 7997).
3. For 92805: As 3298 correctly pointed out, this is a mistake in the paper. It is also fixed and PALIN now returns (82028, 9889, 888).

The updated code is attached (I have also removed the attachments to previous posts to avoid confusion).

For anyone following the thread: the paper linked to in previous posts (on Arxiv) seems to be a preprint that is not the same as the final published paper. It has a bug in Algorithm 1: in the adjustment step when cm==2, it claims that zm==9 (in base 10). However, as in the case of the number 92805, this is demonstrably false. The final published paper corrects this adjustment step and adds the correction for the case when zm != 9.

The final (corrected) paper can be found at this link. I have not had time to see if there are any other differences between the preprint and the final paper.

Sudhir

Attachment removed since there was a bug in SML5 - updated code attached to post #71