Hi,  Maple seems to be unable to solve this kind of differential equation.

dgl:=diff(f(x),x)=f(x)-f(x-1);

 dsolve(dgl);

Error, (in ODEtools/info) found the indeterminate function f with different arguments {f(x), f(x-1)}

Is there any command or package which allows me to construct a general rooted tree? It seems that the GraphTheory package can only construct complete binary trees or complete k-ary trees...... More generally, how can I program or organize my data using a tree data structure?

Thanks,

Peter

i know how to find limit to one variable but how do go about doing limit when we are giving something like this

  lim (x^2+y^2) ^ (x^2 * y^2) as (x,y) --> (0,0)        

?

They do ask me to use graph to help me out in this limit, but i have no idea how

thx for any help

Hello,

I have created a module which implements several high-level procedures. Each of these call low-level procedures which are - in principle - of no interest to the end user.

Now, when I use the "module:-function()" syntax, everything seems OK. However, when I write this module as a package, using "savelib", and I try loading it back, and using it, the low-level procedures are returned unevaluated. Which obviously is not what I want...

Is there a way to force this evaluation?

The problem:
I'm doing some calcs long to compute (some days). With Maple 12 the print command shows nothing, it seems executed when returning from the procedures.

The question:
How can I print intermediates results/progress in a procedure so they appears immediatly ?

Thanks

Hi

HI all,

I have this polynom

Hello everyone,

I need to write a procedure which takes a function as an input, differentiate it wrt x, multiply the result with x/y, and then evaluate the resulting function of (x,y) in a loop at different (x,y) pairs and return the results. 

I have a problem at the very first step though:

Suppose my function is

y := x->-(x-6)-0.01*(x-6)^3;

hence the new function I want to use in my procedure is

g := (x,y) -> diff(y(x),x)*x/y;

HI all,

After long manipulations, I was able to write the first solution y1 in this form (following the method of Frobenius):

It looks like `forget` works on procedures with option 'cache'.

I realize that there is a routine Cache:-RemovePermanent. But should `forget` be clearing the permanent Cache entries for a procedure?

> cacheFunc := proc() option cache; print(args); args; end proc:
> Cache:-AddPermanent( cacheFunc, [5], 10 );
> op( 4, eval(cacheFunc) );
                      Cache(512, 'permanent' = [5 = 10])
 
> forget(cacheFunc);
> op( 4, eval(cacheFunc) ); # NULL return, it's empty

Q: Write a procedure OddEven that takes a list L of integers and returns a list of the odd-numbered entries followed by the even-numbered entries.  So, for example,
OddEven([1,3,5,7,9,11]);
should return [1,5,9,3,7,11].  (Note: unless you find a clever solution you will need a several-line procedure using proc..end proc.   You will perhaps need an if statement so that you can deal with the case where the list has an odd number of elements and where it has an even number of elements separately.)

My ideas...