Convert Foster Netowrk to Cauer

[hp-zl]

Are you serious about this artificial intelligence or are you just joking?
After all, the above-mentioned the algorithm created by artificial intelligence is pathetic.
It is division with the remainder obtained by laborious subtraction of the divisor (sic!).
If you don't believe it, give him 1000000 and 3 - it will take a while.

But back to the topic, enough of this mockery.
Following the link:
https://www.mathworks.com/help/sps/ref/e...oster.html
I see a continued fraction and the word "Euclid".

It is known that a rational fraction can be expressed as a continued fraction.
The "numbers" of this continued fraction can be obtained using the Euclidean Algorithm.

And that's probably what it comes down to.

Simple numerical example:
35/16=?
Euclid's algorithm:
35 = 2*16 + 3
16 = 5* 3 + 1
3 = 3* 1 + 0 End

The numbers after the "=" signs (2,5,3) are the consecutive numbers of the continued fraction, i.e.:

35/16 = 2 + 1 / (5 + 1/3)
Write it down as a fraction on a piece of paper so you can see it better.

And now HP-Prime comes into action:

dfc(35/16) –> [2,5,3]

and vice versa:

dfc2f([2,5,3]) –> 35/16

Regards.

PS.
I have always said that with this artificial intelligence it is "much ado about nothing".