Christian Wolinski

MaplePrimes Activity


These are replies submitted by Christian Wolinski

Instead of removing my own answer, I accidentally removed someone else's.

You have already spotted the essential difference. The unevaluate is needed when using the $.

@goli Apply this code to your expression:

A := RootOf(6*_Z^3+(27+3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2))*_Z^2+(3*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^4*RootOf(_Z^2*l^2+3*_Z^4-3)^2-9*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^2+90*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2-18*l^4+6*l^6*RootOf(_Z^2*l^2+3*_Z^4-3)^2-81+45*RootOf(_Z^2*l^2+3*_Z^4-3)^2*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2))*_Z-324-3*l^8+l^10*RootOf(_Z^2*l^2+3*_Z^4-3)^2+108*RootOf(_Z^2*l^2+3*_Z^4-3)^2*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)-3*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^6+sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^8*RootOf(_Z^2*l^2+3*_Z^4-3)^2-63*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^2+30*sqrt(9-3*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2)*l^4*RootOf(_Z^2*l^2+3*_Z^4-3)^2+45*l^6*RootOf(_Z^2*l^2+3*_Z^4-3)^2+351*RootOf(_Z^2*l^2+3*_Z^4-3)^2*l^2-108*l^4, index = 1):
L := proc(A, lambda)
  collect(
  (`@`(numer, ((L) -> map2(op, 1, op(2, L))), evala,  Factors, evala, Norm))(lambda - convert(A, RootOf)), lambda)
end proc(A, lambda);
F := map(unapply, L, lambda);
factor(evala(F(A))):
subs(l = 1/2, %):
map(Testzero @ proc(x) evalf(x, 60); fnormal(%); end, %);
if member(true, %,'i') then L[i] else FAIL fi;

How effective is series approximation?

@Carl Love Visibly, one more definition is required to solve numerically...

@Carl Love Unexpected. I get unevaluated with maple 2017.

@Glowing Obviously, integers have infinite precision. Your "error" in the code is to use "1014" instead of "1014.".

@Axel Vogt 

restart;
 P1 := 1007;
 P2 := 1014;
 P3 := 1014.1;
 P2 - P1;
 P3 - P1;
 evalf(P2 - P1, 2);
 evalf(P3 - P1, 2);
 
 restart;
 P1 := 1007.;
 P2 := 1014.;
 P3 := 1014.1;
 P2 - P1;
 P3 - P1;
 evalf(P2 - P1, 2);
 evalf(P3 - P1, 2);

@taro You can replace identical(w^sigma) with identical(w)^Non(integer) as convert/parfrac will not accept non integer powers of the variable. Also, You are correct. If You negate the first element in the list then you will see the type of which  occurences will be substituted. In this case it is Non(Non(identical(w^sigma))) = identical(w^sigma). The items in the second element in the list will present without substitution, preserved. Note, the substitutions are applied only to the face of the expression passed and the result returned. If you want to see how it works out You may want to use print:

frontend(proc(E,a,v) print('args'); convert('args'); end ,[e_n_1b2,parfrac, w^sigma],[{Non}(identical(w^sigma)), {}]);
 

 

@HS I expect it is because in your equation mod is applied only to the rhs: "Q2 = P2 mod p". If you want to campare mod p then apply modulus to all elements compared. "(Q2 = P2) mod p" will apply to all elements.

Does evalb((Q2 = P2) mod p); work?

Are we to assume that k stands for K and i stands for I?
Also notice you are using e^(-k*h), e^(-k*z). That should be exp(-k*h) and exp(-k*z).

Have you made any progress with this equation?

I am assuming you are trying to compare dates to determine which comes first. Depending on ordering DayCount is positive or negative. Maybe you can use this.

@Stretto Maybe it will be of use. If you want to color code the entire vertical of a bar to your coloring scheme then I suppose you must subdivide that bar (yourself). Matrixplot will not do that I believe.

@acer Did not see that.

One question:

solve(And(y < -1, y < x, 0 < (2*x)/(x^2 - 1), x < 1), y);
solve(And(y < -1, y < x, 0 < (2*x)/(x^2 - 1), x < 1), x);
solve(And(y < -1, y < x, 0 < (2*x)/(x^2 - 1), x < 1), x) assuming y<-1;

Is there some other way to induce the answer in the above?

1 2 3 4 5 6 7 Last Page 1 of 14