MaplePrimes Questions


 

Suppose I am given the following summation:

 

sum(a*i, i = 1 .. n)

``

Can Maple write the first few terms of the summation? For example, if I want to see first three terms of the summation, I'd like Maple to output the following:

 

a + 2 a + 3 a

 

My use case is that if I am given a complicated summation, it can be useful to look at the first few terms to see if there are any patterns.

 

The things I've tried are:

 

sum(a*i, i = 1 .. 3)

6*a

(1)

'sum(a*i, i = 1 .. 3)'

sum(a*i, i = 1 .. 3)

(2)

eval(sum(a*i, i = 1 .. 3))

6*a

(3)

expand(sum(a*i, i = 1 .. 3))

6*a````

(4)

``


 

Download expandsum.mw

I really need help to understand this i know it is a non associative operation but i just cannot see how no operator is handled in the computation here


 

A := (rand(1 .. 100))():

8

 

8

 

9424

(1)

A := (rand(1 .. 100))():

33

 

33

 

33

(2)

``


 

Download please_HELP.mw

This will be my last question i promise then i will go to bed for a week.

(its what happens when the government decide after 20 years they are going to make it illegal for me taking stimulants therefore must purchase from non pharmacy sources and can barely afford 1 out of every 2 weeks supply, they charge $6 AUD per tablet on the street so, i was prescribed 8 per day, i earn $250 a week, so yes, that is more than all of my money)

Sorry, just want to repeat that as much as possible to embarass my government an infintesimal amount in public forums, never go to australia, my country is a piece of shit and the people here are on the most part uncivilized socially backward morons 

 

 

Edit: Here is a better worksheet for you comrades 
 

restart

X := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) end proc:

Y := proc (A, B) options operator, arrow; (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)) end proc:

is(X(A, B) <> Y(A, B))

false

(1)

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

false

(2)

A := (rand(1 .. 100))():

is((`mod`((`mod`(A, n))*(`mod`(B, n)), n))((`mod`(A, n))*(`mod`(B, n))) <> (`mod`((`mod`(A, n))*(`mod`(B, n)), n))*(`mod`(A, n))*(`mod`(B, n)))

true

(3)

is(X(A, B) <> Y(A, B))

true

(4)

``


 

Download helpPlz.mw

 Hi, I've been trying to solve these PDE below 

Omega*(diff(c(y, t), t))+6*pe*Lambda*(-y^2+y)*cos(2*Pi*x)+pe = diff(c(y, t), y, y)

BC = diff(c(t,1),y)=0,diff(c(t,0),y)=0 

I have got the solution. but could not implement the boundary condition ( maybe those conditions are not correct,/ suggestion needed )

and also have to eliminate those arbitrary constants. pde.mw

 

 

Hello everyone!
Could you help me with the next problem:

1. I have a nonlinear pde system(two equations, two unknown functions: tau(t, r) & R(t, r)) of hyperbolic type.

2. And I have no idea how to solve it.

3. But I know some interesting things about it:

  • In direct variables (tau(t, r) & R(t, r)) this is a nonlinear system maple2.mw
  • But in inverse variables (t(tau, R) & r(tau, R)) it splits into two independent linear differential equations.maple3.mw And we can get a solutions of each in HeunC functions(it would be great if maple could give me an inverse Heun's functions, I couldn't find how). 

4(last). I have a condition in which one of two equtaions = 0, (this condition: tau(t, r) = t) and now I want to try to see what one of the unknown functions(R(t, r)) looks like. But I can not use numeric values. The system describes a spherical gravitational wave, depends on time and distance. r > mass so i want to see some discrete solutions of R(t, r)(jpeg file).the dimensions of t and r are the same. Maybe you have some ideas?
 

In the realm of tetrads where both world indices and Lorentz indices are present, contractions, say, using simultaneously the Minkowskian (galilean) Levi-Civita symbol,

and the curvilinear Levi-Civita (pseudo-)tensor,

can be considered. Although each of the two types of Levi-Civitas can easily be obtained separately by specifying Setup(levicivita = galilean) or Setup(levicivita = nongalilean), I cannot figure out how to have them both available at the same time. Any suggestions?

PS: I am, of course, aware of the fact that the two Levi-Civitas are related by some appropiate square-root of the determinant of the metric, but I have no desire to fiddle around with explicit such determinants if they can be avoided.

This is probably a question to Edgardo: In another thread, the following quantity is considered [Eqs. (5) and (6) combined]:

expand(gamma_[definition]);

This is all very well, but it seems to depend on the metric loaded: if the Schwarzschild metric g_[sc] is loaded, then the above output results, but if the Minkowski metric g_[minkowski] is loaded, then the output of the above expansion is identically zero. Does that make sense? Is that intentional? The explicitly evaluated Ricci rotation coefficients vanish identically for the Minkowski metric, of course, but if evaluation is performed for that case, then why not also for the Schwarschild metric [not meaning to say that I want evaluation]?

In the following codes I am very sure exp(-3*q) is a factor both at numerator and denominator. However, I dont know how to annihilate this factor. Can someone kindly help to ensure it cancels out? Thanks and kind regards.

restart:
s:=(sum(a[j]*x^j,j=0..2)+sum(a[j]*exp(-(j-2)*x),j=3..4)):
F:=diff(s,x):
p1:=simplify(eval(s,x=q))=y[n]:
p2:=simplify(eval(F,x=q))=f[n]:
p3:=simplify(eval(F,x=q+h))=f[n+1]:
p4:=simplify(eval(F,x=q+3*h/2))=f[n+3/2]:
p5:=simplify(eval(F,x=q+2*h))=f[n+2]:

vars:= seq(a[i],i=0..4):
Cc:=eval(<vars>, solve({p||(1..5)}, {vars})):
for i from 1 to 5 do
	a[i-1]:=Cc[i]:
end do:
Cf:=s:
T:y[n+2]=collect(simplify(eval(Cf,x=q+2*h)), [y[n],f[n],f[n+1],f[n+3/2],f[n+2]], recursive);

 

Does anyone know why Maple doesn't simplify the following expression?

Thanks!

 

Hi dears,

I hope that my request (question) is appropriate for Mapleprimes.

I know Gröbner bases and Buchberger's algorithm and I want to understand  the F4-algorithm. However, I know that  the corresponding paper can be found:

https://www.sciencedirect.com/science/article/pii/S0022404999000055 

Could you please state the sketch and main parts of the algorithm s.t. I can understand it?
Is there any primary Maple implementation of F4-algorithm?

Thanks in advance.

Hello All,

 

Please any sugestions on mathmateical projects. They assigned me to do a project for my math class for something I should be interested about. But since the deadline is one week and I don't have anything in mind right now. So I just need y'all help t suggest for me any ideas 

I believe I've found a bug, where Eigenvectors returns two eigenvectors which are the same (even though the eigenvalues are different). The expressions involves RootOf's, and it seems that the eigenvalues use "index" to distinguish themselves, yet the eigenvectors do not.

with(LinearAlgebra);

x := RootOf(z^2-t, z);
m := Matrix(2, (i,j) -> evala(add(a[j, k]*((-1)^(i-1))^k*x^k, k = 0..1)));
ev := Eigenvectors(m);


 

sin(Pi/12);

(1/4)*6^(1/2)*(1-(1/3)*3^(1/2))

(1)

 


 

Download calculation.mws

can anyone explain to me this result ?

in the book "maple by example" they said that sin(Pi/12);
sin (1/12 π)
returns sin(π/12) because it does not know a formula for the explicit value of sin(π/12). but when i'm calculated this in maple i had got , this result, what does this result mean ?

 

hello,

this is my first post here so sorry if it's done wrong...

I'm having difficulties with the following command because maple only returns a solution if the first two boundary conditions of the "if" arguments are true. If the the first or the second condition is false then maple doesn't give a solution solution.

for i to n do if H[i] < 2.7 then if A[i, f] < 12 then if A[i, o] < 1.2 then Q[i, foo] := evalf(610*(A[i, o]*sqrt(H[i])*h[k]*A[i, T])^(1/2)) else Q[i, foo] := evalf(7.8*A[i, t]+378*A[i, o]*sqrt(H[i])) end if end if end if; print(Q[i, foo]); end do;

I've also tried with the elif command but it gives a similar problem

Anyone knows how to solve this?

suppose for example i am working on the function

exp(-I*Pi*(n+2*n*(m-1))/m);

and i wanted to for what ever reason assign a unique symbol to each of the two times the indeterminant 'n' occurs:

exp(-I*Pi*(n[1]+2*n[2]*(m-1))/m)

How could i accomplish this for any function F?

i have tried the method of

map(op, [op(op(exp(-I*Pi*(n+2*n*(m-1))/m)))]);
                [-1, Pi, n, 2 n (m - 1), m, -1]
 

And though i could then use algsubs on the original function for each in the above list, but then ran into problems arising that for any function the number of times i need to map op in iteration is not known, i will actually work this out by the end of the night so i dont know why im bothering asking

 

Edit 2: yep its ok i discovered subsop

Hello All,

 

This is Alex, I'm doing a master degree in computer sience at UMICH. They assigned me to do a math project and deadlined by next week, and I need y'all help to suggest some ideas for me if you guys having any 

 

Thanks 

Ali

First 853 854 855 856 857 858 859 Last Page 855 of 2428