Is there a built-in Maple function to convert decmial inches to inch fraction. For example 1.74 as 1+3/4 ?

Trival to do in Delphi or c++ or even create a Maple function. However I would rather use a built-in function.

Thanks

I have a pair of linear functions I want to differentiate wrt time. The first line defines the functions, and thesecond a substitution that tells maple that the variables of these linear functions, are themselves functions of time.

F := Vector([p[1]*p[6]*(p[2]-x[1]-x[2])-p[3]*x[1], p[4]*p[6]*(p[2]-x[1]-x[2])-p[5]*x[2]])
timefull := [x[1] = x[1](t), x[2] = x[2](t)]

This line should give the ith derivative

Fdiffi := [diff(subs(timefull, F[1]), t$i), diff(subs(timefull, F[2]), t$i)]

however maple gives me a responce in terms of the pochammer function. Why is this? How do i avoid it?

for the questions below

you can use A,B,C as single varible or matrix form if needed

you can use A,B,C as single varible or matrix form if needed

1.how to calculate AA1, AA2 and B2 in terms of A,B,C?

2.how to calculate A,B,C in terms of AA1, AA2 and B2 ?

xrestart;

with(LinearAlgebra):
A := Matrix([[a1,a2,a3],[a4,a5,a6],[a7,a8,a9]]);
B := Matrix([[b1,b2,b3],[b4,b5,b6],[b7,b8,b9]]);
C := Matrix([[c1,c2,c3],[c4,c5,c6],[c7,c8,c9]]);
#AA1,AA2, C:=seq(Matrix(3, symbol=i), i=[a,b,c]);
#AA1 := Matrix([[aaa1,0,0],[0,aaa1,0],[0,0,aaa1]]);
#AA2 := Matrix([[aab1,0,0],[0,aab1,0],[0,0,aab1]]);
#B2 := Matrix([[aabb1,0,0],[0,aabb1,0],[0,0,aabb1]]);
AA1 := Matrix([[aaa1,aaa2,aaa3],[aaa4,aaa5,aaa6],[aaa7,aaa8,aaa9]]);
AA2 := Matrix([[aab1,aab2,aab3],[aab4,aab5,aab6],[aab7,aab8,aab9]]);
B2 := Matrix([[aabb1,aabb2,aabb3],[aabb4,aabb5,aabb6],[aabb7,aabb8,aabb9]]);
eq2 := C.A+C.B;
eq3 := C.B+C;
eq4 := B+C.A;
ABC := fsolve(map(t->Equate(op(t))[], [eq2=AA1,eq3=AA2,eq4=B2]));

I am working on a problem that involves a great deal of combinatorics, and I have broken the problem into several procedures.  I am trying to create a first procedure that creates a list output, a second procedure which takes the list and other input and cycles over combinations of two elements from the list and calls a third procedure to perform the calculus needed for each pair.  A simplified example follows:

f1:=proc(a1, a2, ..., an)
(various if-then statements)

return [b1, b2,...,bn];

end:

f2:=proc(alpha, beta,...,L::list)

A:=0;
for i from 1 to n-1 do
     for j from i+1 to n do
     A:= A+ f2(alpha, beta, ..., L[i], L[j])
     end do;
end do;

return A;

end:

f3:=proc(alpha, beta, ..., bi, bj)

(various mathematical manipulations)
return x;

end:

When I first use f1 to get [b1, b2, ..., bn] and then invoke f2 as f2(alpha, beta, ..., [b1, b2, ..., bn]) everything works fine.

However, f1 needs to be invoked by yet a larger function as follows:
...

L0:=[0,0,0,...,0]:
L0:=f1(a1, a2, ..., an):
B:=f2(alpha, beta,...,L0):

...
When I do this, L0 still gets assigned the correct value according the program trace, yet it fails to invoke f3 correctly.  What could the problem be?

Dear friends,

I have a huge differential equation which I am trying to solve.

However, even solving it numerically, maple keeps evaluating it for a long time and then stops working! So there is no solution.

I just want to check if there is any solution to this differential equation at all!

Do you know a way with which maple can check if the differential equation is solvable?

I need export a r-matrix 300x300 and i received this:

Error, (in ExcelTools:-Export) Export failed. Verify that the exported table does not contain more than 255 columns and 65535 rows.

How can I export this matrix?

How can I plot this one?

Hello,

I try to find all the twinprimes in a certain range of numbers. I made a mistake, but a don't know which one. Wjo can help me?

I solve a linear system of equations which is rank deficient. Naturally, when Maple solves it symbolically, it chooses some of its variables to use them as a basis to express the solution. 

In a specific problem I'm solving, the basis chosen by Maple is -very- smart, showing a good exploitation of the problem structure. 

I'm curious as to what kind of factorization is used by default, or if there's a lot of by hand "black magic" involved, what are its general characteristics. 

Best regards

Claudio

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.

I was using Maple18 for the Ideal Membership Problem. While checking it I got the following error

Error, (in F4:-GroebnerBasis) argument `[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-48,-48,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]/A1[119295][119295]` is incorrect or out of order

Please tell me, how can I resolve this error ?.

Thank You.

I have the following expression.

What I want to do is take the derivative of this expression with respect to,

Where L is somewhere between 1 and n. 

Using the diff operator, I would like to get something like,

But I don't.  Instead, I get zero.  I want to leave n undefined so that the summation isn't automatically expanded out to alot of terms, thereby making it much more difficult to read.  This is especially true as my formulas become more complicated.

Thanks!!

Hello I have this assignment. I will translate it (because it is not english)

This is the assignment: [IMG]http://i68.tinypic.com/2cgoby9.jpg[/IMG]

(if u cant click on the above link, then u can see it here http://tinypic.com/view.php?pic=2cgoby9&s=9)

So it says:

-------

In an examination of young pigs' birth weight 853 newborn pigs were weighted. The weighting is shown in the table down below. 

[0,5-0,7] [0,7-0,9] [0,9-1,1] [1,1-1,3] [1,3-1,5] [1,5-1,7] [1,7-1,9] [1,9-2,1] [2,1-2,3] -> WEIGHT in kg

[26]            [43]       [102]       [145]        [171]      [196]     [119]       [42]          [9]      --> number of pigs

Draw a cumulative frequency curve of the weighting and determine the kvartils.

SO I usually do this in Maple, but this time I did a matrix but nothing happened.. I dont know how I should draw this curve? Help please. 

[IMG]http://i68.tinypic.com/2cgoby9.jpg[/IMG]

do not know why Basis got error in this case.

how to calculate this Basis?

with(LinearAlgebra):
prej := Matrix([[diff(eq2,a),diff(eq2,b),diff(eq2,c)],[diff(eq3,a),diff(eq3,b),diff(eq3,c)],[diff(eq4,a),diff(eq4,b),diff(eq4,c)]]);
jaco := Determinant(prej);
jaco := -a*b*c^2+c^2;
g3 := [diff(jaco,a),diff(jaco,b),diff(jaco,c)];
K := [r-g3[1],u-g3[2],v-g3[3]];
G := Basis(K, 'tord', degrevlex(r,u,v));

Error, (in LinearAlgebra:-Basis) invalid input: LinearAlgebra:-Basis expects its 1st argument, V, to be of type {Vector, {list(Vector), set(Vector)}} but received [b*c^2+r, a*c^2+u, 2*a*b*c-2*c+v]

i find that Suzuki group is very large, 

and finding subrgoup is still not solved 

and when find subgroup of suzuki group that is very slow

i would like to find two subgroup which are not isomorphric and then

prove a normaliser that make them isomorphric

with(GroupTheory):
G := SuzukiGroup();
IsFinite(G);
gorder := GroupOrder(G);
ifactor(gorder);
spg := SylowSubgroup(2, G);
IsAbelian(spg);
Elements(spg);
lprint(%);
H := Subgroup(Elements(G), spg);
N := Normaliser(G, spg);
#N := Normaliser(spg, G);
Elements(N);
lprint(%);
Elements(G);
H2 := Subgroup({[[5,2],[3,4]]}, G);
H2 := Subgroup(Elements(G), G);
elements2 := convert(Elements(G), 'list');
generators := map(ListTools:-Search, [Perm([[1,2,3]])], elements2);
H2 := Subgroup([52], G);
SubgroupMembership(H2, G);
H2 := Subgroup([3], G);
elist := Elements(H2);
AreConjugate(elist[2], elist[3], N); #N*elist[1]*N^(-1) = elist[2]
for ii from 1 to nops(elist) do
for jj from ii+1 to nops(elist) do
if AreIsomorphic(Group(elist[ii]),Group(elist[jj])) = false then
print("noniso");
print(ii);
print(jj);
end if:
od:
od:
AreConjugate(elist[8], elist[22], N); #N*elist[1]*N^(-1) = elist[2]