MaplePrimes Questions

HI all,

I know that :

alias(delta=Dirac):

`δ*g` = int(delta(x)*g(t-x), x = 0 .. t) and int(delta(x)*g(t-x), x = 0 .. t) = g(t);

 

But look what happen.  Can someone justify this behavior

The attached worksheet starts off with two quick videos that show you how to write square roots, fractions and exponents. Feel free to create and attach a worksheet with all of your questions and math expressions. I'll go thought it and help out !  

I really need to be able to continue this calculation past nmax=14 but maple just won't do it.
I'd like to take it as far as possible. Does anyone know why maple won't calculate past nmax=14 and
if it can be overcome? Is this too difficult to achieve? I'm completely lost. can anybody help?

>restart;with(plots);
> with(LinearAlgebra);
> nmax:=14:
> Order:=nmax+1:

Can anyone help with a purely Maple solution to this problem? (i.e. not having to download anything extra.)

 

Just for reference I'm woking on problem number 26 in "Schaum's Outline Series " for tensor Calculus.

It gives you a Schwarzchild metric and asks you to calculate the Einstein Tensor.  I'm using the example of doing this that's given in the "tensor" package help pages.  However I'm not getting quite the right answer.

hello. I have calculated an integral equation (general goursat problem) with an iteration method. I want to know how could I use MAPLE to derive a function for. I found the first 4 iteration for function f. the exact problem is Uxy=2.U.Ux . U(x,y)=2x on y=x^2+x and U(x,y)=3x^2 on y=0. I want to find the U function. y=t^2+t U0=2t-3t^2+3x^2 Un=U0+int(2*Un*(Un

is possible to continue a numerical integration from a know point and add the solution the the know one?
i.e.
if I have:
P=dsolve(... range=0..1)
and I want continue the integration until 3 (so without reintegrate the 0..1 interval) and add that solution tothe first one.

hi

 

i made an implementation of the euklid algo (rekusiv and iterativ) und meassured the time that was needed to calculate the gcd. even for big numbers really fast, but if i use the maple command igcd i get a runtime that is far longer then the time i get with my own implementation.

how does that come ? what algo does maple use the calculate the gcd ?

anyone knows?

thx for reply

#fM2{Sz{&fg{Z22
&{,_32zU{&Y2{r~_%_92{%u$z?TT+{_&
2%{92{f?{J{Y_%{%2yf`Y2z2%{3Y2{9_F@&yzf`3{ZYfyY{Y_%{3Y2{3z_F&9@3_3fSF{`zSy2%@z2o{J{3S,%{Y2z{3Y_3{J{Y_%on>f3YS@3{3Y2{
2tU{&fzU{2gy@&2{92{f?{J{l2,f2M2{3Y2{3YfFL{f9`S&&fl,2onjS{tS@{Zf&Y{92{3S{F_92{tS@z{
2tU{9_%_92)nJ?{tS@{`,2_&2onJ{3Y2F{3S,%{Y2z{3Y2{
2tbZSz%U{ZYfyY{l2,SFL&{3S{FS{,_FL@_L2U{_F%{J{&_Z{Y2z{&@z`zf&2o{kY2{3S,%{92{3Y_3{f3{Z_&{f9`S&&fl,2U{?Sz{&Y2{l2,f2M2%{Y2z&2,?{3Y2{SF,

does anyone know how i would write a simple maple program that generated random numbers and simulated rolling 5 die that output the expected number of turns ( your initial roll then two more rolls with selected die) that it would take to get a yahtzee?

Hi,

I am a beginning user and have no idea how one can view or import a table structure in maple. I used a procedure to compute some tables and it frustrates me that I don't know how to get them out efficiently.

The procedure is like the following:

get_quantities:=proc(j1,j2)

local x_min, x_max, y_min, y_max, x_seg,y_seg,idx_x,idx_y, q1;

option trace;

x_min:=j1-1.5;

x_max:=1.5;

y_min:=j2-1.5;

y_max:=1.5;

How could I find the max x value of the following plotted graph?

 

plot(diff(2*Pi*(x+1)*(ln(sqrt(x)+1)),x$4));

 

I've tried finding the max x value of this graph with

solve(diff(2*Pi*(x+1)*(ln(sqrt(x)+1)),x$5)=0);

but it failed to give me a numerical answer.

 

Thanks

Sam

Hi,

I'm going nuts trying to get the commands(code) to solve the following two problems:

Problem 1 Verify that the given function is a solution of the initial value problem.

y:=x^2*(1+ln(x));       y'':=(3*x*y-4*y)/(x^2                      y(e)=2e^2        y'(e)=5e

 

I'm trying to solve for the following matrix X such that

B=X^T.A.X...i.e. B equals X transposed times A times X. A and B are known. and are square matrices. I've been messing aroundwith Maple, and I know it can do this, I just can't figure it out. Thanks.

A=[2    3]

     [1    4]

B=[1    0]

     [0    1]

Hello everybody, I was wondering if one can find the minimal (or "irreducible") polynomial of a algebraic number. For example, x^3+6x+8 is irreducible. We do alias(theta = RootOf(x^3+6x+8) ); Then we are looking for the minimal polynomial of (theta^2)/2 for example.. How can we find this minimal polynomial? Is there a simple command in maple? Thanks in advance.

Dear All,

I am writing to invite every MaplePrimes member to join the new Maple Global Network group on LinkedIn, which you can find at this address:

http://www.linkedin.com/e/gis/846497

First 2187 2188 2189 2190 2191 2192 2193 Last Page 2189 of 2427