(HP15C / HP41 ) Recursive program of the 1st April

[Nihotte(lma)]

Some digits for a sum

The extended implementation of the program for the HP16C is close to its version for the HP12C .
This umpteenth version directly displays each result of the search explicitly with all its required digits.

The mechanism implemented in this program is the same as that used in the version for the HP12C.
Effectively, 15 hexadecimal digits can fit in a 64-bit word (60 bits is enough).

So, this is the program, to find at most the 15 digits to use for a sum of 120.

(Unlike the HP12C, there is no arithmetic on the registers for the HP16C. 1, STO + 1 changes to RCL 1, 1, +, STO 1. However, the tests are more provided. The consolidation of the 2 implementations makes it possible to write, in the same spirit, a version optimized for the HP11C ! Welcome in the dance, too...).