Hi 

does anyone know how to make a programme to find values of B^j+1 and B^j+1 where:

matrix([[A^j+1],[B^j+1]]) = matrix([[C,D], [E,F]])*matrix([[A^j],[ B^j])

and with the initial condition that A^j =0, B^j=1. and then run to find say A^6 etc

thx 

I created a maplet in maple using the following codes:

> restart:
> with(Maplets[Elements]):
> m5:=Maplet(
> Window('title'="Turev", 
> [
> ["Fonksiyon:",TextField['Y1']()],
> ["Turev Degiskeni:",TextField['Y2'](3)],
> TextBox['TB1']('editable'='false',3..40),
> [Button("Turevi Hesapla",Evaluate('TB1'='diff(Y1,Y2)')),
> Button("Tamam",Shutdown(['Y1','Y2','TB1'])),
> Button("Temizle",SetOption('Y1'=""))]

Dear friends,

every once in a while I come across an integral that Maple does not readily compute and post it here, so that your programmers may perhaps include it in the integration engine.

I am writing today concerning the integral int(x^q/(exp(x)-1), x=0..infinity); for q a real number. Maple can do this integral for rational q but not for irrational ones, e.g. try q=14/10 vs. q=sqrt(2). I hope you can make good use of this hint. The original computation...

Lately as my computations become ever more intense, I have been having trouble with fsolve. Why exactly does fsolve sometimes return itself as in:

E:=fsolve({C1,C2,C3,C4},{c1,c2,c3,c4}}

returns--> fsolve({C1,C2,C3,C4},{c1,c2,c3,c4}}

and somtimes fsolve returns a blank.

What is going on internally here? Shouldn't it keep trying till it runs out of memory?

Thanks,

Pat

Hi

Does anyone know if it is possible to loglogplot a function like:

y=const, x=0..10^3

y=x^(-3/8), x=10^3..10^8

It would be really useful to plot.

I have added a .mw file showing the problem. I wish to calculate the integral at the bottom of the post. unfortunately the function im using defined at he beginning of the file doesnt behave well for values k larger than 25/30...

The integral I need to evaluate therefore cant be evaluated if one wants to integrate from 0 to Infinity.

Also just integrating till 20 or so is not accurate enough...

Has anybody an idea about better implementation of the problem....

I need more help with code please!

A box of candy hearts contains 52 hearts, of which 19 are white, 10 are tan, 7 are pink, 3 are purple, 5 are yellow, 2 are orange, and 6 are green. If you select 9 pieces randomly without replacement, what is the probability that A_3 of the 9 are white, and B_3 of the 9 are white, 2 are tan 1 is pink and 1 is yellow and 2 are green

19 Whites in the pack / 52 hearts in the pack = .3654 possibility of picking a white from 1 draw.

Today's SMBC strip by Zach Weinersmith is a silly math joke but it was pretty much begging for implementation.

So, here is a simple brute force Maple program to compute the Fouriest transform of an integer.

fouriest := proc(n::posint, ob::posint:=10)
local b,f,cap,i,rdx,fc;
...

How can I write code for : A coin is tossed 4x, the sequence of H and T is observed. I need to list each of the 16 sequences (which, when done manually are :

S= {hhhh,hhht,hhth,hthh,thhh,hhtt,htht,thth,tthh,thht,htth,ttth,ttht,thtt,httt,tttt}

b) Let events A,B,C,D be given A= {at least 3 heads}, B= {at most 2 heads}, C= {heads on the third toss}, D= {1 head and 3 tails}. If the probability set function assigns 1/16 to each outcome in the sample space find ...

I am trying to evalute a double integral symbolically using Maple 15.  I have gotten it to work when some of the parameters are specific numbers, but it won't work if I use variables, even if I assume sufficient conditions on them for the integral to make sense.  I have tried to use AllSolutions but it didn't work.  Breaking it down into steps isn't working either. 

I am working on a file on a remote server and I don't think I can upload it here. ...

We assume that the length of a match is 1, then the perimeter of a polygon is equal to the number of matches N. If a match can be located at arbitrary angles to each other, then at a given perimeter of the area can take on any value between zero and the area of a regular polygon (for even number of matches) . For an odd number of matches the lower bound equals to the area of an equilateral triangle of side 1. For any given area within these boundaries will be infinitely many solutions.

The school computer labs use Maple 15. As it is a considerable drive for me to come in and use the lab during the hours I am not on campus, I picked up Maple 16. This has worked fine for me until today. I am trying to use the "polarplot" command to plot two equations r=8*cos(3θ) and r=4-2.5cos(θ). Doing so on the computer lab Maple 15 plots fine. When I do so on Maple 16 on my computer I get something different. If I switch the order of the equations on 16 I get...

I dont know what to do any further...

I have some function containing HeunG as a function

it is of the following form

f(k)=argument(functions containing HeunG) - ln(2)*k

now plotting this works...

But when differentiating with respect to k and then plotting it gives me the following message:

Warning, expecting only range variable k in expression (I*((1/2)^(1/2*I*k))^2*HeunG(3,-9/2+3/4*I*k-3/4*k^2,-1+1/2*I*k,-1/2+1/2*I*k,1/2,1+I*k,1/2...

Hi,

I have two differential equations describing a solar sail in 2D.

One is my radial direction and one is the tangential direction.

I have plotted r(t) and theta(t) but I want r(theta) so I have assigned my two differential equations and initial conditions, have my two plots for r and theta in terms of t and then I have used the following command to plot in polar coordinates: