While theorem provers have become surprisingly powerful over the last decade, they are still too cumbersome to use and too limited in their capabilities to have any impact as teaching tools. As a case in point, see the recent study by Freek Wiedijk [12] where the fifteen major systems available today are challenged to prove that the square-root of 2 is irrational. One way around this problem is to use a hybrid system that combines a pure theorem prover with a computer algebra system, like Mathematica and Maple. In such hybrid systems the theorem prover organizes and controls the logical part of the argument whereas the computer algebra system takes care of all algebraic manipulations. Application of this rule shortens some proofs tremendously, and also brings the argument much closer to the form that a human prover would employ.