1. Polynomial Greatest Common Divisors
Let's compute the gcd of two polynomials using SAC-2. Put this one into a CaminoReal tool:
X
Then put this one into a CaminoReal tool:
X .
Then primary select the first one, copy select the second, hit the "OpPrimary" button, and select "gcd". Watch the file transfers in the Terminal Viewer, and result comes back as:
X .
Just for fun, let's factor these polynomials (need to use Reduce for this at the moment):
X
This runs for a long time (> 15 minutes) without returning. Next try
X
This one took about 27 minutes, but curious thing is that Reduce says its irreducible. And it is easy to see that X-1 doesn't divide it, since evaluation at X=1 yields -59. Hence SAC-2 gcd above clearly wrong; probably a result of the displayed form giving the wrong idea of what Meddle has actually stored internally.