Hello

I have a list with n positive integer numbers and a positive integer k.

I would like to write a Malple programm, that calculates, in how many ways k can be written as a sum of numbers in the list.

Easy examles: let the list be [2,3,6,9].

k=9 can be written in 4 ways: 9=9, 9=6+3, 9=3+3+3, 9=3+2+2+2. The result therefore shoud be 4.

k=8 can be written in 3 ways: 8=6+2, 8=3+3+2, 8=2+2+2+2. The result therefore shoud be 3.

Thank you very much your help!

I cannot get this to work:

Hi everyone,

I am using Maple for quite a while, now I would like to do something new.

I am a teacher at a german highschool and I would like to generate class tests with maple. Say for an example, I need 30 tests,  where the first task is calculating the first derivative of a function. This function should be different for every person, for example f(x)=a*x^3+3x^2, where the value of a is different in every test (probably random).

So what I need is a way to generate nice looking sheets in Maple (including page breaks, titles and so on). Is there a way to generate such a thing in maple or do I have to export to TeX and adjust there quite a bit?

Maybe someone has done a similar thing. Actually I am looking for something like serial letters in Maple.

Any idea, how I could do such a thing?

Thanx for your help,

Axel

GraphTheory:-GraphEqual says that G₁ and G₂ are equal, but GraphTheory:-AllPairsDistance gives different results instead: 

Download allpairs.mw

So, which one is incorrect? Any reasons?

Download bug.mw

Hi

I think there is a bug in the "randpoly" command. please see the attached file line 7 of my procedure "randomzero". Why x^2-y-4 is created while terms=1 is considered and the outputs must contain binomial?

Some work, while others don't work. 
 

Download unable_to_sum.mw

How to explain this behavior?
I have read the help page, but I can not get the point.

Please, is there anyway I can solve this problem with a nice output? The solution I got is complicated. Please, helper is need

f := exp(-beta*x)*x^(5-alpha)

int(f, x)

beta^(alpha-6)*(-x^(-alpha)*beta^(-alpha)*(alpha^4-14*alpha^3+71*alpha^2-154*alpha+120)*(alpha-6)*(beta*x)^((1/2)*alpha)*exp(-(1/2)*beta*x)*WhittakerM(-(1/2)*alpha, -(1/2)*alpha+1/2, beta*x)/(-alpha+6)+x^(-alpha)*beta^(-alpha)*(beta^4*x^4-alpha*beta^3*x^3+alpha^2*beta^2*x^2+5*beta^3*x^3-alpha^3*beta*x-9*alpha*beta^2*x^2+alpha^4+12*alpha^2*beta*x+20*beta^2*x^2-14*alpha^3-47*alpha*beta*x+71*alpha^2+60*beta*x-154*alpha+120)*(alpha-6)*(beta*x)^((1/2)*alpha)*exp(-(1/2)*beta*x)*WhittakerM(-(1/2)*alpha+1, -(1/2)*alpha+1/2, beta*x)/(-alpha+6))

How to write a program that obtains the value of the function by giving different values
Like the example below:

I rephrased my previous question in a more synthetic form
(there was probably a lot in it that I thought was important for understanding the problem, but I realized afterwards that it only added confusion).

The true question is yellow-highlighted in the code below

Download solve_erf.mw

For those interested in the motivations of this quastion, see here Where_does_the_question_come_from.mw

The original question is here Original_question.pdf

How is the expansion of trigonometric functions in Maple like the following function?

Hi!

I'm trying to recreate a Mathcad sheet in Maple Flow

I could use some help figuring out how elementwise operations are made:

From mathcad, what i want to reproduce:

What I have in Maple Flow so far:

1) How do i get MF to output numerical valus in sigma_t ?

2) How would H look in MF? 

Thank you!

Ragards
Siggi

that in Kip Thorne's book Maple is mentioned through out ?

Kip Thorne and Roger Blandford : "Modern Classical Physics: Optics, Fluids, Plasmas, Elasticity, Relativity, and Statistical Physics"

also, courtesy of Caltech in Chapter 24

restart;
alias(u = u(x, z, t), f = f(x, z, t));
                              u, f
u := (f+sqrt(R))*exp(I*R*x);
                    /     (1/2)\           
                    \f + R     / exp(I R x)
pde1 := I*(diff(u, z))+diff(u, x, x)+diff(u, t, t)+u*abs(u)*abs(u)-(u*abs(u)*abs(u))*abs(u)*abs(u);
    / d   \              / d  / d   \\           
  I |--- f| exp(I R x) + |--- |--- f|| exp(I R x)
    \ dz  /              \ dx \ dx  //           

           / d   \                /     (1/2)\  2           
     + 2 I |--- f| R exp(I R x) - \f + R     / R  exp(I R x)
           \ dx  /                                          

       / d  / d   \\           
     + |--- |--- f|| exp(I R x)
       \ dt \ dt  //           

                                                            2
       /     (1/2)\                           2 |     (1/2)| 
     + \f + R     / exp(I R x) (exp(-Im(R x)))  |f + R     | 

                                                            4
       /     (1/2)\                           4 |     (1/2)| 
     - \f + R     / exp(I R x) (exp(-Im(R x)))  |f + R     | 

simplify(%);
         / d   \              / d  / d   \\           
       I |--- f| exp(I R x) + |--- |--- f|| exp(I R x)
         \ dz  /              \ dx \ dx  //           

                / d   \                 2             
          + 2 I |--- f| R exp(I R x) - R  exp(I R x) f
                \ dx  /                               

             (5/2)              / d  / d   \\           
          - R      exp(I R x) + |--- |--- f|| exp(I R x)
                                \ dt \ dt  //           

                                               2  
                                   |     (1/2)|   
          + exp(I R x - 2 Im(R x)) |f + R     |  f

                                               2       
                                   |     (1/2)|   (1/2)
          + exp(I R x - 2 Im(R x)) |f + R     |  R     

                                               4  
                                   |     (1/2)|   
          - exp(I R x - 4 Im(R x)) |f + R     |  f

                                               4       
                                   |     (1/2)|   (1/2)
          - exp(I R x - 4 Im(R x)) |f + R     |  R     
collect(%, exp(I*R*x));
  /  (5/2)       / d   \      2       / d   \   / d  / d   \\
  |-R      + 2 I |--- f| R - R  f + I |--- f| + |--- |--- f||
  \              \ dx  /              \ dz  /   \ dx \ dx  //

       / d  / d   \\\           
     + |--- |--- f||| exp(I R x)
       \ dt \ dt  ///           

                                          2  
                              |     (1/2)|   
     + exp(I R x - 2 Im(R x)) |f + R     |  f

                                          2       
                              |     (1/2)|   (1/2)
     + exp(I R x - 2 Im(R x)) |f + R     |  R     

                                          4  
                              |     (1/2)|   
     - exp(I R x - 4 Im(R x)) |f + R     |  f

                                          4       
                              |     (1/2)|   (1/2)
     - exp(I R x - 4 Im(R x)) |f + R     |  R     
 

Hi Dears

I need some random zero-dimensional binomial ideals (20 ideals or more) with two, three, or four ... generators with 4 variables atmost. Then I want to regenerate each of them such that some of their generators are not binomial and the obtained ideals are equal to the first corresponding original binomial ideals. How can do I this automatically?

As a simple example let I be an ideal generated by {x-1, y-1, z-1} which is zero-dim. We can obtain J=<x-z, x+z-2, y+z-2> that is equal to I.

Thank you in advance.

Dear all

I have the following code that  compute a parameter labeled by A. 

I used some input vectors and my aim is to get A <1 

A_less_than_one.mw

I tried to change some values of input vectors but unfortunattely I can not have A<1 

Maybe I have a mistake in the code or something else 

Thank you for your help