Items tagged with integer

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;

i have an image and would like to perform a canny edge detection. one of the first steps is the convolution of the image with a smoothed derivative filter, i.e. a gaussian. the problem is, that i don`t know, how to convolve my collection of discrete pixels (the image) with a 2D gaussian. how do i get an integer-valued convolution kernel that approximates a Gaussian with a variable sigma?

I use the interactive plot builder (at least Maple14) and want to define a parameter to be an integer.

How do I carry this into execution?


If a function is differentiable at some point c of its domain, then it is also continuous at c. However here we extend the notion of differentiability to be valid for individual points on the real number line, specifically positive integers.

 f(n)=(-1)^n* n^(1/n)


f=f' / (I*Pi+(1-ln(n))/n^2)| n ∈ {1,2,3,...}

By THEOREM MRBK 4.0, When n is in the set of (positive) integers the derivative of f is exactly I*Pi*f+(1-ln(n))*f/n^2.

So f' = I*Pi*f+(1-ln(n))*f/n^2| n ∈ {1,2,3,...}

Solving for f, we have the following:

f' = I*Pi*f+(1-ln(n))*f/n^2

f' = f*(I*Pi+(1-ln(n))/n^2)

f=f' / (I*Pi+(1-ln(n))/n^2)


For more on this click here (W/A).

how can i found the integer number after any divident using maple commands




Am I missing some justification for this last one?

> zip(`/`,Array([3]),Array([9]));
> zip(`/`,Array([3],datatype=integer[4]),Array([9]));
> zip(`/`,Array([3]),Array([9],datatype=integer[4]));
> zip(`/`,Array([3],datatype=integer[4]),Array([9],datatype=integer[4]));

In the list of how irrational, rational, and from small to large integers to sort.Can not calculate irrational. Can you help? Thanks

Since the MRB constant is an alternating sum of positive integers to their own roots, f(n)=(-1)^n* n^(1/n); a thorough understanding of the changes in f, as n changes, is important.
In this blog we will begin to explore the derivative of f at integer values of n, and as n-> infinity. I am not sure weather this will help us in computing more digits of the MRB constant since we already know so many,

okay, so I was asked this question

Hello Everyone,


i try to solve a function for zero (numerically) that contains the cdf of the binomial distribution, but i can't get i work. Maple (13) simply returns the equation without any solution.... Or strikes because of the non-algebraic content...


Let p(x,t) describe a probability for a binary event. Let Bcdf(z-2,n,p(x,t)) denote the binomial cdf such that the probability that this event happens at least z  out of n times, where z and n  are integers.

I want to compute:

I did the following:


CRRA := t->((t)^(1-rho))/(1-rho);
X1 := RandomVariable(Geometric(q));
assume(t::integer, 0 < rho, rho <> 1, 0 < q, q < 1);

As result I get a formula, where Maple defines _t0 (as far as I can see in italic font).

But why does Maple do so, and what does this mean?


Thx for answering.

I want to evaluate a polynomial and turn its coefficients into hfloats. Shouldn't evalhf do this? For example:
f := randpoly([x,y,z]);  # integer coefficients
g := evalf(f);    # software float coefficients
h := evalhf(f);   # error
I think the last one should give me a polynomial with hardware floating point coefficients. Instead I get an error.

I have a multivariable function, F(n, g(1,0),g(0,1),g(0,2),g(1,1),g(2,1),...,g(n,1),g(n-1,2),...,g(1,n)), of indeterminates g(i,j) (omitting g(0,0) - in other words - let L = set of all pairs of nonnegative integers, (i,j), which satsify 1<= i+j <=n) of the following form F = product over all the (i,j) in L of g(i,j)^h(i,j) / ((i!

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