Convert Foster Netowrk to Cauer

[jte]

(06-03-2024 01:48 PM)KeithB Wrote:  ⋮
Matlab has a function to do this:
https://www.mathworks.com/help/sps/ref/e...oster.html

Which uses "Euclid Long Division", is this something I can do on the Prime?

By the way “Euclid Long Division” is referenced, my first interpretation is that it’s not integers that are being thought of / assumed as the domain of interest. The process used for integers can be used in wider contexts. One typical example in an introductory university course would be polynomials.

This sort of thing can be done on the HP Prime with the CAS command “quorem”. For example, evaluating

quorem(48*q^3+3,16*q^2+2,q)

gives back

[3*q,-6*q+3]

which indicates that dividing 48*q^3+3 by 16*q^2+2 gives a quotient of 3*q and a remainder of -6*q+3. Iterating over this can let one convert, e.g., rational polynomials to a continued fraction whose terms are polynomials. (Along the same vein as converting a rational number to a continued fraction whose terms are integers.)