6663b6c9
 adorian
projet complet av...
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
#include <quiz.h>
#include <poincare.h>
#include <ion.h>
#include <assert.h>
#include <cmath>
#include "helper.h"
using namespace Poincare;
QUIZ_CASE(poincare_power_evaluate) {
assert_parsed_expression_evaluates_to<float>("2^3", "8");
assert_parsed_expression_evaluates_to<double>("(3+I)^4", "28+96*I");
assert_parsed_expression_evaluates_to<float>("4^(3+I)", "11.74125+62.91378*I");
assert_parsed_expression_evaluates_to<double>("(3+I)^(3+I)", "(-11.898191759852)+19.592921596609*I");
assert_parsed_expression_evaluates_to<double>("0^0", "undef");
assert_parsed_expression_evaluates_to<double>("0^2", "0");
assert_parsed_expression_evaluates_to<double>("0^(-2)", "undef");
assert_parsed_expression_evaluates_to<double>("(-2)^4.2", "14.8690638497+10.8030072384*I", Radian, Cartesian, 12);
assert_parsed_expression_evaluates_to<double>("(-0.1)^4", "0.0001", Radian, Cartesian, 12);
#if MATRICES_ARE_DEFINED
assert_parsed_expression_evaluates_to<float>("[[1,2][3,4]]^(-3)", "[[-14.75,6.75][10.125,-4.625]]", Degree, Cartesian, 6);
assert_parsed_expression_evaluates_to<double>("[[1,2][3,4]]^3", "[[37,54][81,118]]");
#endif
assert_parsed_expression_evaluates_to<float>("0^2", "0");
assert_parsed_expression_evaluates_to<double>("I^I", "2.0787957635076E-1");
assert_parsed_expression_evaluates_to<float>("1.006666666666667^60", "1.48985", Radian, Cartesian, 6);
assert_parsed_expression_evaluates_to<double>("1.006666666666667^60", "1.4898457083016");
assert_parsed_expression_evaluates_to<float>("X^(I*P)", "-1");
assert_parsed_expression_evaluates_to<double>("X^(I*P)", "-1");
assert_parsed_expression_evaluates_to<float>("X^(I*P+2)", "-7.38906", Radian, Cartesian, 6);
assert_parsed_expression_evaluates_to<double>("X^(I*P+2)", "-7.3890560989307");
}
QUIZ_CASE(poincare_power_simplify) {
assert_parsed_expression_simplify_to("3^4", "81");
assert_parsed_expression_simplify_to("3^(-4)", "1/81");
assert_parsed_expression_simplify_to("1256^(1/3)*x", "2*root(157,3)*x");
assert_parsed_expression_simplify_to("1256^(-1/3)", "1/(2*root(157,3))");
assert_parsed_expression_simplify_to("32^(-1/5)", "1/2");
assert_parsed_expression_simplify_to("(2+3-4)^(x)", "1");
assert_parsed_expression_simplify_to("1^x", "1");
assert_parsed_expression_simplify_to("x^1", "x");
assert_parsed_expression_simplify_to("0^3", "0");
assert_parsed_expression_simplify_to("0^0", "undef");
assert_parsed_expression_simplify_to("0^(-3)", "undef");
assert_parsed_expression_simplify_to("4^0.5", "2");
assert_parsed_expression_simplify_to("8^0.5", "2*R(2)");
assert_parsed_expression_simplify_to("(12^4*3)^(0.5)", "144*R(3)");
assert_parsed_expression_simplify_to("(2^A)^B", "2^(A*B)");
assert_parsed_expression_simplify_to("(2*A)^B", "2^B*A^B");
assert_parsed_expression_simplify_to("(12^4*x)^(0.5)", "144*R(x)");
assert_parsed_expression_simplify_to("R(32)", "4*R(2)");
assert_parsed_expression_simplify_to("R(3^2)", "3");
assert_parsed_expression_simplify_to("2^(2+P)", "4*2^P");
assert_parsed_expression_simplify_to("R(5513219850886344455940081)", "2348024669991");
assert_parsed_expression_simplify_to("R(154355776)", "12424");
assert_parsed_expression_simplify_to("R(P)^2", "P");
assert_parsed_expression_simplify_to("R(P^2)", "P");
assert_parsed_expression_simplify_to("R((-P)^2)", "P");
assert_parsed_expression_simplify_to("R(x*144)", "12*R(x)");
assert_parsed_expression_simplify_to("R(x*144*P^2)", "12*R(x)*P");
assert_parsed_expression_simplify_to("R(x*144*P)", "12*R(x)*R(P)");
assert_parsed_expression_simplify_to("R(2-4*R(2))", "R((-2)+4*R(2))*I");
assert_parsed_expression_simplify_to("x^(1/2)", "R(x)");
assert_parsed_expression_simplify_to("x^(-1/2)", "1/R(x)");
assert_parsed_expression_simplify_to("x^(1/7)", "root(x,7)");
assert_parsed_expression_simplify_to("x^(-1/7)", "1/root(x,7)");
assert_parsed_expression_simplify_to("1/(3R(2))", "R(2)/6");
assert_parsed_expression_simplify_to("X^ln(3)", "3");
assert_parsed_expression_simplify_to("X^ln(R(3))", "R(3)");
assert_parsed_expression_simplify_to("P^log(R(3),P)", "R(3)");
assert_parsed_expression_simplify_to("10^log(P)", "P");
assert_parsed_expression_simplify_to("X^ln(65)", "65");
assert_parsed_expression_simplify_to("X^ln(PX)", "P*X");
assert_parsed_expression_simplify_to("X^log(PX)", "X^(log(P)+log(X))");
assert_parsed_expression_simplify_to("R(X^2)", "X");
assert_parsed_expression_simplify_to("999^(10000/3)", "999^(10000/3)");
/* This does not reduce but should not as the integer is above
* k_maxNumberOfPrimeFactors and thus it prime decomposition might overflow
* 32 factors. */
assert_parsed_expression_simplify_to("1881676377434183981909562699940347954480361860897069^(1/3)", "root(1881676377434183981909562699940347954480361860897069,3)");
/* This does not reduce but should not as the prime decomposition involves
* factors above k_maxNumberOfPrimeFactors. */
assert_parsed_expression_simplify_to("1002101470343^(1/3)", "root(1002101470343,3)");
assert_parsed_expression_simplify_to("(x+P)^(3)", "x^3+3*x^2*P+3*x*P^2+P^3");
assert_parsed_expression_simplify_to("(5+R(2))^(-8)", "(1446241-1003320*R(2))/78310985281");
assert_parsed_expression_simplify_to("(5*P+R(2))^(-5)", "1/(4*R(2)+100*P+500*R(2)*P^2+2500*P^3+3125*R(2)*P^4+3125*P^5)");
assert_parsed_expression_simplify_to("(1+R(2)+R(3))^5", "296+224*R(2)+184*R(3)+120*R(6)");
assert_parsed_expression_simplify_to("(P+R(2)+R(3)+x)^(-3)", "1/(11*R(2)+9*R(3)+15*x+6*R(6)*x+3*R(2)*x^2+3*R(3)*x^2+x^3+15*P+6*R(6)*P+6*R(2)*x*P+6*R(3)*x*P+3*x^2*P+3*R(2)*P^2+3*R(3)*P^2+3*x*P^2+P^3)");
assert_parsed_expression_simplify_to("1.006666666666667^60", "(1006666666666667/1000000000000000)^60");
assert_parsed_expression_simplify_to("2^(6+P+x)", "64*2^(x+P)");
}
|