## Assumptions on Im(z) and complex exponentials...

In my code I'm trying to catch the case when a certain limit doesn't exist:

```limit(exp(-I*a*z)/a, a = infinity) assuming Im(z) > 0;
0
```

Doesn't work. Strangely, this works:

```limit(exp(-I*a*z)/a, a = infinity) assuming Im(z) > 0, z::complex;
undefined
```

But this again doesn't:

```limit(cos(a*z)/a, a = infinity) assuming Im(z) > 0, z::complex;
0
```

(because the limit of cos(a*z) returns -1..1).

So then I decide to check the exponents directly:

```is(a*Im(z) > 0) assuming a > 0, Im(z) > 0;
false
```

Doesn't work, even though it works for arbitrary f:

```is(a*f(z) > 0) assuming a > 0, f(z) > 0;
true
```

I found a construct that works:

```signum(Im(a*z)) assuming a > 0, Im(z) > 0;
1
```

Would it be possible to improve the handling of the assumptions on Re/Im though?

## "assuming" and "assume" ......

Hi;
what's the difference between "assuming" and "assume" commands in maple? tell me this problem with example. Thanks.
with regards...

## Why doesn't Maple evaulate this simple expression?...

Maple does not evaluate

>Re( (2-I*X)^4) ),  assuming((X, realcons)

or

>assume(X, realcons);

> Re( (2-I*X)^4) );

Why do these simple expression return unevealuated?

## Can I solve an inequality with an assumption?...

Hello people in mapleprimes,

I want to modify the inequality of e assuming d.
But, e/(1-a) assuming(d) does not work well.
How can I do for this?

```d:=(a>0,a<1,b>0,c>0);
0 < a, a < 1, 0 < b, 0 < c
e:=(1-a)*b>c;
c < (1 - a) b
e/(1-a)assuming(d);
`*`(c<(1-a)b,1/(1-a))
```

inequality.mw

## How to extract Real and Imaginary using assumption...

I can't get the Real and Imaginary parts of matrix to seperate out as required. It is an SU(2) matrix. Want to convert is to a 4 Vector (quaternion). I think because Maple doesnt know what psi(t) is being conservative so to speak. Tried assume, assuming...

 (1)

 (2)

 (3)

## how to use assuming x > 0 in if condition statemen...

#my testing for wildcard to one
#after testing, it loop a very long time and not stop
ppp := [[0,0,0,x],[0,0,1,0],[0,1,0,0],[1,0,0,0]]:
check1 := [seq(0,ii=1..nops(ppp))];
ttt1 := [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]:
mmmeaght1 := [seq(0,ii=1..nops(ppp[1]))]:
bbb1 := [seq(0,ii=1..nops(ppp[1]))]:
emap := [(xx) -> if [xx < 0 assuming x > 0] then 0 else 1 end if, (xx) -> evalf(1/(1+exp(xx)))]:
#trace(perceptronrule1);
MM(ppp, ttt1, mmmeaght1, bbb1, check1, emap);

when test wildcard variable for input, would like to assume x > 0 then

i try assuming x > 0 , got error

## Slick technique to select positive root of polynom...

I want to solve for the roots of a polynomial, such as a x^2+b x + c = 0, for which the output is only the positive root. All coefficients/variables in the polynomial are positive.

Recently, someone posted an answer to a question where at some point they performed this task and their solution was really slick. But I can't find it. The answer used either solve, or eval or something like that. (Yes, I did perform a search via the MaplePrimes search before asking this question.)

## Roots, lists and substitute...

Dear Friends,

I would appreciate your help in resolving some issues. Let me describe my dummy code and the issues I am having.

1. I have two functions f(x,a) and g(x,a) are well defined.

2. I need to get roots of f(x,a). I am using the command soln := Roots(f(x,a)) which gives me a list of all possible values of x.

3. I need to choose only one element -- say x* -- from the list "soln" such that x*=argmax{g(x,a) | g(x,a)>0 for x in soln}.

I am not able to find a technique (i) to evaluate g(x,a) for all elements of the list "soln", (ii) and select x* that maximizes g(x,a).

Picking and choosing elements of the list one by one is difficult since the number of elements in the list can vary with parameter "a" and it would complicate the matter in numerical studies.

I would sincerely appreciate any inputs in this regard.

Thank you,

Omkar

 (1)

 (2)

## solve using assume option...

how can solve using assume option ?

 > restart:
 > F(z):=m*z^4-4*m*z^3+(3*m+3)*z^2-6*u;
 (1)
 > solve(F(z),z assuming -0.5
 >

## Simplifying Radicals: Part III...

In this question, I asked for a way to simplify an expression containing radicals. The discussion led us to that as default field for simplicfication is the Complex number system we should use assume or assuming command to simplify the radicals. However, the mothod suggested there seems to not work in this new case that I have. For details please see the attached file. The terms sqrt{u} and sqrt{u-1} should cancel in denominator.

What Maple Does

 >
 >
 (1)
 >
 (2)
 >
 (3)
 >
 (4)
 >
 (5)
 >
 (6)
 >

Remark by Markiyan Hirnyk. The below content is added by the questionner on 08.02.2016 .

What Mathematica Does

## How to solve hard inequality?...

How to solve the inequality

,

assuming a::real ?

Of course, with Maple. I'd like to demonstrate the difficulties, solving

>solve(log[2*abs(x-a)](abs(x+a)+abs(x-a)) < 1, x) assuming a > 0, a < 1/2

.

The correct answer under the above restrictions is

{x  > 0, x  <  a} union {a  <  x, x <  a + 1/2} union { -infinity < x, x < a - 1/2}.

This is a problem from Lviv math school olympiad '2016.

## Compute values using function ...

Dear all;

Hello everybody, I need your help to dispaly some values obtained using my function f. When I run the code there is no results obtained. Many thanks.

restart:

# The vectors e(i) satify the folowing conditions
e(0)*e(1)=e(n-1) assuming  1<n;
e(0)*e(0)=e(2):
e(1)*e(1)=e(n-1) assuming  1<n: :
e(2)*e(1)=e(n) assuming  1<n:
#
for i from 1  to n-1 do
e(i)*e(0)=e(i+1);
end do:

# We define the function f
f:=e(0)->e(0)+(n-3)*e(1);
f:=e(1)->(n-2)*e(1);
for i from 2  to 3 do
f:=e(i)->(n+i-3)*e(i)+(i-1)*(n-3)*e(n-3+i);
end do:

for i from 4 to n do
f:=e(i)->(n+i-3)*e(i)
end do:

# We define the two vectors
x:=sum(alpha(k)*e(k),k=0..n);
y:=sum(beta(k)*e(k),k=0..n);

#Question : I would like to compute the following  but there is no display of the solution.
(x*y);
f(x*y);
f(x);
f(y);
x*f(y);
f(x)*y;
f(x*y)- f(x)*y-x*f(y);

## Computing eigenvalues with assumptions...

I am trying to simplify the eigenvalues of a 2x2 matrix [[a,b],[c,d]] subject to the condition a,b,c, and d are integers such that a+b = c+d. Why do the following commands not achieve this?

with(LinearAlgebra):

A:=Matrix[[a,b],[c,d]]):

Eigenvalues(A) assuming a::integer,b::integer,c::integer,d::integer,a+b=d+c

How might I achieve what I need?

## limit of sequence at infinity bugs

by: Maple

The following limit does not return a value. Then the evalf gives a wrong answer.

The answer should be "undefined" or -infinity .. infinity.

limit(exp(n)/(-1)^n, n = infinity) assuming n::posint; evalf(%);

/exp(n)              \
limit|------, n = infinity|
|    n               |
\(-1)                /

0.

The same happens if you delete the assumption.

A similar problem occurs with

limit(sin(Pi/2+2*Pi*n), n = infinity) assuming n::posint;
-1 .. 1
without the assumption this would be appropriate.

 1 2 3 Page 1 of 3
﻿