About the 39GS

[Gerald H]

I don't know, toml_12953, how to answer you.

Perhaps an example:

If you look at this thread

http://www.hpmuseum.org/forum/thread-10026.html

you will see the development of a programme that I enjoyed working on, in the hope of producing a short & fast programme in an environment with, by today's standards, limited resources (a 50g).

The final version is able to find a partition of a 44,400 digit number in c 21 sec, which I consider reasonably fast.

True, more modern hardware will deal with the problem much more efficiently.

So perhaps you, or some interested Prime adept, could write a Prime programme to partition a 44,444 digit integer in palindromic parts more efficiently?