Hello! 

I have system of equations to solve. It has 118 equations and all variables have to be binary. I know for that system that the minial number for x=1 is 32 (I cheked it in solution chapter at the end of the book) but I always get 33 of ones. I changed MaxSols=500 and still got 33. If I change MaxSols to some bigger number the time for calculation is larger and I still don't get the correct solution. Is there any faster way to do this?

I'm thinking (but I don't know how to do in Maple): Is there any way to show solutions only with number of ones in interval, for example 30 to 33.

try1.mw

I have a question about Hilbert Series of the quotient of an algebra by a non-homogenous ideal. 

In maple help: https://www.maplesoft.com/support/help/maple/view.aspx?path=Groebner%2FHilbertSeries, it is said that 

The algorithms for HilbertSeries and HilbertPolynomial use the leading monomials of a total degree Groebner basis for J. Here J is an ideal.

I checked the following example. Let 

J:= [(x[2]-x[1])*(x[2]-x[3]), (x[4]-x[1])*(-x[5]+x[4]), (x[4]-x[2])*(x[4]-x[6]), (-x[3]+x[5])*(x[5]-x[6]), x[1]^3-1, x[2]^3-1, x[3]^3-1, x[4]^3-1, x[5]^3-1, x[6]^3-1];

and

t1:=map(LeadingMonomial, l, grlex(x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12]));

Then t1 is the ideal generated by the following monomials.
t1 := [x[1]*x[2], x[1]*x[4], x[2]*x[4], x[3]*x[5], x[1]^3, x[2]^3, x[3]^3, x[4]^3, x[5]^3, x[6]^3]

Using the commands:

l2:={x[1],x[2],x[3],x[4],x[5],x[6],x[7],x[8],x[9],x[10],x[11],x[12]};

factor(HilbertSeries(J, l2, t));

factor(HilbertSeries(t1, l2, t));

We obtain Hilbert(J,t)=(t^2+t+1)*(5*t^4+11*t^3+11*t^2+5*t+1)
Hilbert(t1, t) = (t^2+t+1)*(3*t^2+3*t+1)*(2*t^2+2*t+1)

These two polynomials are not equal. How does maple compute Hilbert Series for the quotient of an algebra by a non-homogenous ideal? Thank you very much.

Is there any way to integrate this in maple?

lambda^2*t*(diff(theta(t), t, t)) = lambda^2*(diff(theta(t), t))-Pr*s*lambda*(diff(theta(t), t))+Pr*(diff(theta(t), t))-Pr*t*(diff(theta(t), t))

If I used factor, it didn't simplify to 0. As you may notice that this value should be 0.

Hello!

I need help, because I can't find solution.
How can I export data from Bode Plot to Excel? Two below solutions don't work.

with(DynamicSystems);

T2 := TransferFunction((1.224867518*10^(-7)*s+2.259345677*10^(-6))/(s^2+11.83692270*s+238.3951363)):

BP2 := BodePlot(T2);

with(ExcelTools);
ExcelTools:-Export(op([1, 1], BP2));

Export(BP2, "Employees13.xls", "Payroll1", "B2");
 

File_1.mw

Never really used the writeto command but what's with all the typesetting gobbledygook in the text file?  It occurs with document and worksheet mode.  Perhaps it's only meant for classic or command line maple?

Is there a way to log the terminal output to a .txt file?

Dear all

Trying to plot this expresion

f := epsilon-1.5+9.3*I = (a+I*b)*(26.+I*(-45.-1.0*Re(a+I*b)^2-1.0*Im(a+I*b)^2))

implicitplot (a^2+b^2) against epsilon

many thanks

I am trying to solve a linear system involving large number of equations with constant coefficients using Solve command from the LinearAlgebra package. The maple program is giving solutions for a smaller number of equations (T=10,Ne=20,Ng=15). But if I increase the number of equations to (T=20,Ne=30, Ng=25), then I got the error kernel connection has been lost. I need to increase the number of equations beyond this also. Any help to simplify the code or finding errors is appreciated.

solntosystem.mw

I would like to perform an implicit differentiation of the following:

eqn := 5*(x*y)^2+x/sqrt(y) = x^2+2*(3*x^3+y^2)^3

However implicitdiff(eqn, x, y); produces an output that expands the result.  Is there a way to not have it expand?

I tried something to the effect of...

eqn := 5*(x*y(x))^2+x/sqrt(y(x)) = x^2+2*(3*x^3+y(x)^2)^3;

diff(eqn, x);

but now what I need to to isolate d/dx y(x)...

Any suggestions are much appreciated.

 my question is
I am working on for loop and there are multi-line inside it and I only need to show a specific result, not all that occurs inside the loop . is there any commend to do that in maple?

with(Statistics):

LetList := [C, E, F, H, K, P, T, W, X, Y]; LetList[Sample()];
           LetList := [C, E, F, H, K, P, T, W, X, Y]
Error, invalid input: no implementation of Sample matches the arguments in call, 'Sample:-ModuleApply()'

Can any one help me with random sampling from LetList ?

Melvin

what is the code of the following equation:

 where h, and g are matrices with positive determenets. 

How can we create the following upper triangular matrix?

where k and M are any integers,
 F and L are MxM Matrices  as follows

restart;
with(LinearAlgebra):
k:=2:
M:=3:
F:=Matrix(M,M):
for i from 1 to M do 
  for j from 1 to M do
 F[1,1] := 2;
    F[i,j]:=0
  end do
end do:
F;
L:=Matrix(M,M): 
L:=LinearAlgebra[BandMatrix]([
      [seq(-sqrt(2*i-1)/(2*i-1)*sqrt(2*i-3),i=2..M)], [1,seq(0*i,i=1..M-1)],[seq((sqrt(2*i-3))/((2*i-3)*sqrt(2*i-1)),i=2..M)]]);

Dear Users!

Hope you would be fine with everything. I want to evaluate the following expression for k = 3, j = 0, r = 1.

I am waiting for your positive reply. Thanks in advance