asa12

380 Reputation

9 Badges

4 years, 139 days

MaplePrimes Activity


These are questions asked by asa12

i use

A -> B

B -> C

would like to find A -> C directly from A -> B and B -> C

but logic table show that AND(A->B, B->C) is not equal to A -> C

and (A->B) -> (B->C) is not equal to A -> C too

which logic operations can do this?

because do not want to use result to verify and because i do not know the result in the beginning

for example

func1 := proc(system1)

for i from 1 to 100 do

solve([system1[1], system1[2]],[x,y]);

od:

end proc:

 

func1([diff(y,t) = data[i+t+1], diff(x,t) = data[i+t+1]])

i is depend on the for loop inside a function, but woud like to pass this system into a function with i

this will cause error

how to write better for passing a system as parameter using variable inside a function?

indets(AA(MM(AA(X1,X2),B2),MM(AA(B2,X3),X5)));
this can get a list of X1,X2,B2,X3,X5

propositionsentence := MM(AA("it", "run"), "maple"):
indets(propositionsentence);

but this can not get "it", "run", "maple"

how to do this in case this in maple 12?
 

i use optimization package with constraint hello >= 0

Minimize(xx=0, {hello >= 0})

but solution only return the case when hello = 0

how about hello > 0?

i would like to find all possible set of solutions using this constraint

do i need to set upper bound, such as {hello <= 7, hello >=0}

can it return solution when hello = 1.1, 1.2, ...2, 2.1, 2.2, 2.3, ....7

How to create a hyperplane which perpendicular to groebner basis

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