- unsigned result = 0;
- symbol a("a"), b("b"), c("c");
-
- ex e = c - (b*a-c*a)/(4-a);
- ex f;
- ex d = (b*a-4*c)/(a-4);
- try {
- f = e.normal();
- if (!(f - d).expand().is_zero()) {
- clog << "normal(" << e << ") returns " << f
- << " instead of " << d << endl;
- ++result;
- }
- } catch (const exception & err) {
- clog << "normal(" << e << ") cought an exception: "
- << err.what() << endl;
- ++result;
- }
- return result;
+ unsigned result = 0;
+
+ ex q = (pow(pow(2, numeric(1, 2))*2+1, 2)).expand();
+ // this used to produce "1+4*sqrt(2)+4*2" which would never evaluate
+ // to "9+4*sqrt(2)"
+
+ if (!(q-9-4*pow(2, numeric(1, 2))).is_zero()) {
+ clog << "expand((sqrt(2)*2+1)^2) erroneously returned " << q << " instead of 9-4*sqrt(2)\n";
+ ++result;
+ }
+
+ return result;
+}
+
+// Expanding products containing powers of sums could return results that
+// were not fully expanded. Fixed on Dec 10, 2003.
+static unsigned exam_paranoia16()
+{
+ unsigned result = 0;
+ symbol a("a"), b("b"), c("c"), d("d"), e("e");
+ ex e1, e2, e3;
+
+ e1 = pow(1+a*sqrt(b+c), 2);
+ e2 = e1.expand();
+
+ if (e2.has(pow(a, 2)*(b+c))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = (d*sqrt(a+b)+a*sqrt(c+d))*(b*sqrt(a+b)+a*sqrt(c+d));
+ e2 = e1.expand();
+
+ if (e2.has(pow(a, 2)*(c+d))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = (a+sqrt(b+c))*sqrt(b+c)*(d+sqrt(b+c));
+ e2 = e1.expand();
+
+ if (e2.has(a*(b+c))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = pow(sqrt(a+b)+sqrt(c+d), 3);
+ e2 = e1.expand();
+
+ if (e2.has(3*(a+b)*sqrt(c+d)) || e2.has(3*(c+d)*sqrt(a+b))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = a*(b+c*(d+e));
+ e2 = e1.expand();
+
+ if (e2.has(c*(d+e))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = 2*pow(1+a, 2)/a;
+ e2 = e1.expand();
+
+ if (e2.has(pow(a, 2))) {
+ clog << "expand(" << e1 << ") didn't fully expand\n";
+ ++result;
+ }
+
+ e1 = a*(a+b);
+ e2 = pow(pow(e1, -1), -1);
+
+ if (e2.has(a*b)) {
+ clog << "double reciprocal expanded where it should not\n";
+ ++result;
+ }
+
+ return result;