The sophisticated HP-65

[C.Ret]

(08-01-2022 10:12 PM)Matt Agajanian Wrote:  So, what is the most sophisticated program you’ve written for the 65?

Up to now, the most sophisticated program I write for the HP-65 is concerning the position of any rational in the Calkin–Wilf tree. It was a part of the numerous exchanges and works-out from the MPO96 challenge in the french forum www.silicium.org (Sept 06,2020).

   

Label A is used to calculate the index of U(n) from the rational A/B (the GCD is in register R2 at the end of the calculation): a [ENTER^] b (A) displays U(n) .
Label D makes it possible to determine the rational A/B from the index of U(n): n [ D ] displays A then [SST] displays B.