Yes. Rich's excellent overview alluded to the implementation of binary operations: ======== ... You can add X and Y by starting with the form (X+Y)/1, and using the general form (aXY+bX+cY+d)/(eXY+fX+gY+h); this also works for multiplication and division, with starting forms (XY)/1 or X/Y. It's equally good at converting decimal to CFs, or doing arithmetic on decimals or CFs, etc. You can even link together these CF machines to compute complicated expressions ... ========
On Mar 16, 2019, at 9:01 PM, Dan Asimov <dasimov@earthlink.net> wrote:
PS Let me add some afterthoughts:
----- Question: --------- Are there algorithms relating the cfe's of x and y with the cfe of simple functions of x and y like
x + y
x - y
x * y
x / y
x ^ y
—Dan
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun