Items tagged with integer



I want to create a Textbox which will be opened in the beginning of a Maple code. In this Textbox I want to write an integer, which will be used for a following calculation.

I already found this code:


> restart; with(Maplets[Elements]);
print(`output redirected...`); # input placeholder
> maplet := Maplet([["Insert Text", BoxCell(TextBox['IB1'](1 .. 10))], [Button("OK", Shutdown(['IB1'])), Button("Cancel", Shutdown())]]);

Hello everyone

I want to check whether a recurrence relation produces integers. What I have written is rather messy, I ideally would like some kind of Proc where I can just put in the recurrence relation, the initial conditions and the number of terms I would like to check. Then get a result out which tells me whether the terms in the sequence are all integer. 


I have written the following (which tells me what I want to know but in a crude way)

I have a 3rd order nonlinear recurrence relation and I would like to produce the associated sequence.

Here is the relation x[n+2]:=(((x[n+1]*x[n])^2+x[n]^2+x[n+1]^3))/x[n-1]. At the moment the method I am using (a standard do command) is very computationally heavy when I want lots of iterates. I was wondering if there were faster loops, or procs.

Also I would like some kind of way to check if all the terms are integers, maybe some kind of summation where an...



at first I have to admit, that I'm totaly new to maple and have only few experience with the programm.


That's the problem. I've got an old maple-code which I want to rewrite in the 2d-Math-syntax. In the code there are a lot of variables of the type "numerical integer" with a form like




--> with index in the name

It's a code for a physical-/chemical- process so the...

How can i trunc (find closest integer) each element in a matrix ? 

This is my matrix equation:

for n to 20 do 'CD'^n, 'F' = evalf(C[1].D[1]^n.F[1]) end do

And i want to show  "trunced" results


I am new to Maple, so sorry for asking this TRIVIAL question but I got quite frustrated after so much time unsuccessfully trying to figure out how to perform integer computations.

Lets take the simple example below:

3k - 5 = 0

I wanna get k=1 not 5/3

Isolve doesn’t work  for this as I would like. Introduced assumptions re ignored:

Solve(3*k -5=0, k, useassumptions) assuming k :: nonnegint

If I have 

F = x + 2π_Z1~

Is there a function/operator I can apply to F which returns only x, discarding 2π_Z1~?  That is, I want to return only the base angle, and dump the added integer multiple of 2π term.


I am trying to simplify the expression s as given below. (I am not sure why it comes up with all the vector caclulus notation in it but it should display okay when you enter it)

Because of the presence of the exponential imaginary fucntions I thought evalc might be useful but when I use it I get a huge expression with csgn appearing in it. To my knowledge csgn appears when assumptions are not correctly specified - is this so? I can't see any assumption...

Maple evaluates

> sum(1/z^2, z = 1 .. infinity)

to (1/6)*Pi^2. What do I do when sumation is over all even positive integers? Is there any  closed-form symbolic formula for this case?

Above is the minimal example. What I need is to compute 

> sum(2*binomial(m-1, k-1)*binomial(n-1, k-1)/binomial(m+n, m), k = 1 .. infinity)

where k belongs to a set of only even positive integers, not any posint. The second expression evaluates to 2*m*n/((m+n-1...

If I use a binary {0,1} linear program the cardinal constraint ie control the
number of 1's (long positions in portfolio) works beautiful. See attached worksheet.

The problem starts when I convert the problem into a constrained integer {-1,0,1}
linear problem where -1= short position, 0=no position and 1=long position.

In the first example when we add the constraint  add(w[i], i = 1 .. NC) = 4

I can solve a [0,1] linear programming problem by using:

LPSolve(Ob, con, assume = binary);

I managed to solve [-1,1] linear programming problem by using the transformation
2*w[i]-1 ie   2*0-1=-1 and 2*1-1=1 as follows:

LPSolve(add(PP[i]*(2*w[i]-1), i = 1 .. NC)-add(Draw[i]*(2*w[i]-1), i = 1 .. NC), {add(w[i], i = 1 .. NC) = PS}, maximize = true, assume = binary);

Now my question is how can I solve a [-1,0,1] problem?
I tried to use:

 x := proc (i::integer)

      return i^2;

end proc:


Error, invalid input: x expects its 1st argument, i, to be of type integer, but received i.


If I want to reserve the ::integer declaration, How to solve this problem. I know if there is no

I have the simplified version of what I want to do:

restart: with(LinearAlgebra):



But I get the following error:

Error, (in Matrix) integer indices required for Matrix

Help appreciated.




Hi e-friends,

I want to minimize a function subject to a set of S restrictions.

The restrictions are related to matrices V, W, X and Y:


V = [v1, .., vS]  order L x S

W = [w1, .., wS] order L x S


X = [x1, .., xS]  order LxS

Y = [y11,.. yS] order L x S


How may I write in MAPLE in compact form  the following S inequalities (for any arbitrary integers L and S)?. ...

Hey peeps


I'm quite new to maple, and to this site, so I hope I do this properly.

I'm trying to make a procedure, that througout the procedure divides 2 numbers. But I need it to round down to the nearest integers, at all time, as I need an integer as output. I have searched quite a lot, and haven't found anything that helps me to do this.

The procedure is the following:

walla := proc (x) local y, z, w;

y := x;

2 3 4 5 6 7 8 Last Page 4 of 23