Items tagged with sequence

Why do you need `or` in an if-test if say:

if `or`(seq(R[i]=R[k], k=1..i-1)) then
.......
end if;

If I run the test without the `or` (Boolean type logical, I know) it does not work.

Can anyone help me?

Dear all

I have n, p two integers greater than one

I would like to minimize the following real number by a fixed positive constant if its possible

(n/(n+p))^(n/p)-(n/(n+p))^((n+p)/p)

Many thanks

I'm displaying a series of point plots as an animation, and would like to update a displayed parameter as well.  I have a nested list L[t] where there's a set of points for each t, and for each t there's also a numerical value M that I'd like to display.  (In my real problem, L[t] is the number of particles in each of several states, and M is the rms deviation from am algebraic probability distribution.)  

The closest I've gotten (for a simple L and M) is the following, but it displays all of the M values in the legend at once:

with(plots); with(Statistics);

L := [[1, 2, 3, 4, 5, 6], [2, 4, 6, 8, 10, 12]];

M := [1, 2];

display([seq(PointPlot(L[t], legend = M[t]), t = 1 .. 2)], insequence = true)

 

I don't need this to be in the legend.  Is there a way to display only the current value of M for each t?  Thanks very much.

Hi,

I'm currently writing my thesis and actually haven't used Maple before.

I've got the following problem with converting the results of a sequence:

seq(Optimization:-Maximize(function with 2 variables), parameter:0..1,0.1)

The results are ok, but I can't convert the values to a spreadsheet with 4 columns (parameter value, maximum value, value of variable 1, value of variable 2).

Thank you!

Best regards

Using Maple 2016, I created a new Document with one line:

A=(1,2,3)

Right-clicking on this expression I thought I could choose Assign to a Name, as is done in Clickable Calculus Series - Part 3: Multivariate Calculus, found here:

https://www.youtube.com/watch?v=GYN-GetHRFA

However, Assign to a Name does not appear in the context menu.

On the other hand, if I write

B=1,2,3

(with no parentheses) and right-click on this expression then Assign to a Name does appear in the context menu.

Any insights on this?

Thanks. 

When using seq function below in the second call, it does not generate a sequence of functions with 'a' being 1, 2, and 3, and I had expected. 

First seq function call is just to show that it works without the function "x ->" wrapping.

I could of couse use unapply as in the third call, but I had expected the second call to work.

Am I doing anything wrong, or is this a Maple bug?

Hello

Any idea about the summation of Fibonacci sequence

 

Fibonacci.mw

 

Best regards

 

i'm using maple in a research but i want to add a recursive function h_m(t) in 2 case : if m is integer positive and not, 
la formule est donnée comme suit :  if (mod(m,1) = 0  and m>0) then  h:=proc(m,t)  local  t ;  h[0,t]:=t ;   for  i from -4 to  m  by  2 do  h [m,t]:= h[0, t]-(GAMMA(i/(2)))/(2*GAMMA((i+1)/(2)))*cos(Pi*t)*sin(Pi*t)  od:  fi:  end; 
  if (mod(m,1) = 0  and m>0) then  h:=proc(m,t)  local  t ;  h[0,t]:=t ;   for  i from -4 to  m  by  2 do  h [m,t]:= h[0, t]-(GAMMA(i/(2)))/(2*GAMMA((i+1)/(2)))*cos(Pi*t)*sin(Pi*t)  od:  fi:  end;
and i wanna to know how to programmate a Gaus Hypegeometric function. Thank You

 

Is there a Maple function that given a set of substitutions in form object=set of substitute objects produces a sequence of sets, each a product of substitution from the next, remove repetitions. An example:

 

#Substitutions
a = {b, c, d}, b = {a, b, e}, c = {a, d, f};
#Result
a = ({e, f}, {b, c, d}), b = ({f}, {c, d}, {a, b, e}), c = ({e}, {b}, {a, d, f});

I need to do this with a sequence of a large number of elements but here is my question with a sequence of fewer elements.

a:={10,11,-13,9,20,74,10}:

I want to check each element of the sequence if it is negative. And if any element is negative I want to replace with 0 (or do something else). I tried the following code but it didn't work. 

for k from 1 to 7 do
  if (a[k]<0) then subs(a[k]=0, a) end if:
end do;

Please help me to figure it out. 

Hello,

Paraphrasing:

https://en.m.wikipedia.org/wiki/Langford_pairing

given a sequence of 2n numbers 1,1,2,2,3,3,...n,n in which the two 1's are 1 slot apart, the two 2's are 2 slots apart, the two 3's are 3 slots apart, -> generally the two n's are n slots apart.

for n=3, a possible sequence is [2,3,1,2,1,3]. 

There is sequences for n=4,7,8...

i havent a clue how to write a maple procedure to generate a sequence for given n, but I'm hoping an expert here can.

(Some) prime reciprocals have an interesting property. the repeating sequence has length p-1.

eg 7, has repeats after 6.

1/7=0.142857142857......

17 has repeats after 16

1/17=0.05882352941176470588235294117647059.........

of course some primes don''t have this property....

So what I need the experts here is for some code

myproc(17)=16, (and the sequence) 0588235294117647

my go:pinched from

http://199.71.183.11/questions/39621-Pattern-Matching-In-A-Sequence-Of-Digits

PriDigits := "" || (op(1, evalf(1/17, 50)));

reps := StringTools[Repeats](PriDigits);

lngth := seq(op(3, A), A in [reps]);

the leading 0 (which is part of the sequence)  is a problem.....

 

 

hi every one, i would like to know if it is possible to implement the following recursive sequence in Maple :

q(1)       = q(0)        +q_dot(0)
q_dot(1)  = q_dot(0)  +q_ddot(0)
q_ddot(1) = q_ddot(0)+q_dddot

 

q(2)       = q(1)        +q_dot(1)   = (q(0)+q_dot(0)) + (q_dot(0)+q_ddot(0)) = q(0)+2q_dot(0)+q_ddot(0)
q_dot(2)  = q_dot(1)  +q_ddot(1)
q_ddot(2) = q_ddot(1)+q_dddot

 

q(3)      = q(2)        +q_dot(2)=(q(0)+2q_dot(0)+q_ddot(0))+(q_dot(1)+q_ddot(1))= q(0)+3q_dot(0)+q_ddot(0)+q_dddot
q_dot(3) = q_dot(2)  +q_ddot(2)
q_ddot(3)= q_ddot(2)+q_dddot

I would like every q(n) to be expressed as following : q(n)=q(0)+n_1*q_dot(0)+n_2*q_ddot(0)+n_3*q_dddot.

By computing manually some sequences i am now sure that :
n_1=n
n_2=(n²-n)/2
n_3=?? (I would like to find this one)

The sequence can be written in a more general way as following :
q(n)        = q(n-1) + q_dot(n-1)
q_dot(n)   = q_dot(n-1) + q_ddot(n-1)
q_ddot(n) =q_ddot(n-1)+q_dddot

Can you guys please show me how this can be implementes in Maple ?

Thanks in advance

I have the following question:

Illustrate how the sequence N->R de fined by n ->n^2/n^2 + 31n + 228 can be shown to be
within a given epsilon > 0 of its limiting value x0.
(a) use an appropriate conditional statement to find N such that abs (xn -􀀀 x0) < epsilon for every n>=N
and produce an appropriate list of the data points (n,xn) to illustrate
this

I found N but without using any CONDITIONAL STATEMENT.Can you help me find N using IF FOR WHILE?

Hello everyone.  Let n be a positive number; I seek how to write the matrix Z\in M_{2^n,n} that is defined as follows:

for every i,j, Z_{ij}\in \{-1,1\}.

When I consider the 2^n rows of Z, I want to find ALL the possible sequences of length n with the entries +-1. A toy example, when n=2, is Z=\begin{pmatrix}1&1\\1&-1\\-1&1\\-1&-1\end{pmatrix}.

Thanks in advance;

1 2 3 4 5 6 Page 1 of 6