1 /** @file exam_factor.cpp
3 * Factorization test suite. */
6 * GiNaC Copyright (C) 1999-2018 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24 using namespace GiNaC;
29 static symbol w("w"), x("x"), y("y"), z("z");
31 static unsigned check_factor(const ex& e)
34 ex answer = factor(ee);
35 if ( answer.expand() != ee || answer != e ) {
36 clog << "factorization of " << e << " == " << ee << " gave wrong result: " << answer << endl;
42 static unsigned exam_factor1()
50 e = ex("1+x-x^3", syms);
51 result += check_factor(e);
53 e = ex("1+x^6+x", syms);
54 result += check_factor(e);
56 e = ex("1-x^6+x", syms);
57 result += check_factor(e);
59 e = ex("(1+x)^3", syms);
60 result += check_factor(e);
62 e = ex("(x+1)*(x+4)", syms);
63 result += check_factor(e);
65 e = ex("x^6-3*x^5+x^4-3*x^3-x^2-3*x+1", syms);
66 result += check_factor(e);
68 e = ex("(-1+x)^3*(1+x)^3*(1+x^2)", syms);
69 result += check_factor(e);
71 e = ex("-(-168+20*x-x^2)*(30+x)", syms);
72 result += check_factor(e);
74 e = ex("x^2*(x-3)^2*(x^3-5*x+7)", syms);
75 result += check_factor(e);
77 e = ex("-6*x^2*(x-3)", syms);
78 result += check_factor(e);
80 e = ex("x^16+11*x^4+121", syms);
81 result += check_factor(e);
83 e = ex("x^8-40*x^6+352*x^4-960*x^2+576", syms);
84 result += check_factor(e);
86 e = ex("x*(2+x^2)*(1+x+x^3+x^2+x^6+x^5+x^4)*(1+x)^2*(1-x+x^2)^2*(-1+x)", syms);
87 result += check_factor(e);
89 e = ex("(x+4+x^2-x^3+43*x^4)*(x+1-x^2-3*x^3+4*x^4)", syms);
90 result += check_factor(e);
92 e = ex("-x^2*(x-1)*(1+x^2)", syms);
93 result += check_factor(e);
96 result += check_factor(e);
99 e = ex("(1+x)*(1+x^2-x^29-x^11-x^25-x^9-x^35+x^20-x^3+x^16-x^15-x-x^13+x^28+x^24-x^33+x^8-x^19+x^36+x^12-x^27+x^10-x^23+x^18+x^14+x^34-x^31+x^32+x^30-x^5+x^26+x^4+x^22-x^21-x^7-x^17+x^6)", syms);
100 result += check_factor(e);
102 e = ex("(1+4*x)*x^2*(1-4*x+16*x^2)*(3+5*x+92*x^3)", syms);
103 result += check_factor(e);
105 e = ex("(77+11*x^3+25*x^2+27*x+102*x^4)*(85+57*x^3+92*x^2+29*x+66*x^4)", syms);
106 result += check_factor(e);
111 static unsigned exam_factor2()
115 symbol x("x"), y("y"), z("z");
116 lst syms = {x, y, z};
119 result += check_factor(e);
121 e = ex("(x^2-y+1)*(x+y)", syms);
122 result += check_factor(e);
124 e = ex("-2*(x+y)*(x-y)", syms);
125 result += check_factor(e);
127 e = ex("(16+x^2*z^3)*(-17+3*x-5*z)*(2*x+3*z)*(x-y^2-z^3)", syms);
128 result += check_factor(e);
130 e = ex("(x-y*z)*(x-y^2-z^3)*(x+y+z)", syms);
131 result += check_factor(e);
133 e = ex("-(y^2-x+z^3)*x*(x+y+z)", syms);
134 result += check_factor(e);
136 e = ex("-316*(3*x-4*z)*(2*x+3*z)*(x+y)*(-1+x)", syms);
137 result += check_factor(e);
139 e = ex("(x+x^3+z^2)*(3*x-4*z)", syms);
140 result += check_factor(e);
142 e = ex("250*(-3+x)*(4*z-3*x)*(x^3+z^2+x)*x", syms);
143 result += check_factor(e);
145 e = ex("327*(x+z^2+x^3)*(3*x-4*z)*(-7+5*x-x^3)*(1+x+x^2)", syms);
146 result += check_factor(e);
148 e = ex("x-y^2-z^3", syms);
149 result += check_factor(e);
151 e = ex("-390*(7+3*x^4)*(2+x^2)*(x-z^3-y^2)", syms);
152 result += check_factor(e);
154 e = ex("55*(1+x)^2*(3*x-4*z)*(1+x+x^2)*(x+x^3+z^2)", syms);
155 result += check_factor(e);
157 e = ex("x+y*x-1", syms);
158 result += check_factor(e);
160 e = ex("390*(-1+x^6-x)*(7+3*x^4)*(2+x^2)*(y+x)*(-1+y-x^2)*(1+x^2+x)^2", syms);
161 result += check_factor(e);
163 e = ex("310*(y+x)*(-1+y-x^2)", syms);
164 result += check_factor(e);
169 static unsigned exam_factor3()
173 symbol k("k"), n("n");
176 e = ex("1/2*(-3+3*k-n)*(-2+3*k-n)*(-1+3*k-n)", syms);
177 result += check_factor(e);
179 e = ex("1/4*(2*k-n)*(-1+2*k-n)", syms);
180 result += check_factor(e);
185 static unsigned check_factorization(const exvector& factors)
187 ex e = dynallocate<mul>(factors);
188 ex ef = factor(e.expand());
189 if (ef.nops() != factors.size()) {
190 clog << "wrong number of factors, expected " << factors.size() <<
191 ", got " << ef.nops();
194 for (size_t i = 0; i < ef.nops(); ++i) {
195 if (find(factors.begin(), factors.end(), ef.op(i)) == factors.end()) {
196 clog << "wrong factorization: term not found: " << ef.op(i);
203 static unsigned factor_integer_content_bug()
207 factors.push_back(reader("x+y+x*y"));
208 factors.push_back(reader("3*x+2*y"));
209 return check_factorization(factors);
212 unsigned exam_factor()
216 cout << "examining polynomial factorization" << flush;
218 result += exam_factor1(); cout << '.' << flush;
219 result += exam_factor2(); cout << '.' << flush;
220 result += exam_factor3(); cout << '.' << flush;
221 result += factor_integer_content_bug();
222 cout << '.' << flush;
227 int main(int argc, char** argv)
229 return exam_factor();