Advanced Search

aabdulla

15 Reputation

One Badge

4 years, 226 days
Contact aabdulla

MaplePrimes Activity


These are questions asked by aabdulla

Trying to evaluate an integral (with no ...

aabdulla 15 Maple 2019
integration syntax
February 08 2020
1 5

Hi,

 

I have two functions that I took the inetgral of their product (1.3 and 1). Then i multiplied the resulting naswer with the variable and integrates again however the inetgral did not evaluate (3,4, and 5). 

I was able to calculate both inegrals using tables of integrals, MATLAB & Mathematica were able to evaluate.

any insights on why this may happening?

Integrals_Sheet2.mw

Recursive Formula returning: Error, (in...

aabdulla 15 Maple 2019
recurrence recursive-assignment
February 08 2020
3 2

Hi,

 

I am trying to use Maple to evaluate the recursion series as below, but I am getting an error when I try to call c: Error, (in depends) too many levels of recursion

Recursion.mw

 


 

 

> 

b := proc (k) options operator, arrow; (-1)^k*GAMMA(1+(1/2)*k)^2/factorial(k) end proc

proc (k) options operator, arrow; (-1)^k*GAMMA(1+(1/2)*k)^2/factorial(k) end proc

 (1)
> 

c := proc (k) options operator, arrow; piecewise(k = 0, b(0)^N, 1 <= k, (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0))) end proc

proc (k) options operator, arrow; piecewise(k = 0, b(0)^N, 1 <= k, (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0))) end proc

 (2)
> 

b(2)^N

(1/2)^N

 (3)
> 

c(1)

Error, (in depends) too many levels of recursion

  

 

> 

F := proc (s, kmax, N) options operator, arrow; sum(c(k)*s^k, k = 0 .. kmax) end proc

proc (s, kmax, N) options operator, arrow; sum(c(k)*s^k, k = 0 .. kmax) end proc

 (4)
> 

powcreate(c(k) = (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0)), c(0) = b(0)^N)

Error, (in depends) too many levels of recursion

  
> 

c := rsolve({c(0) = b(0)^N, c(k) = (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0))}, c(k), makeproc)

Error, (in depends) too many levels of recursion

  
> 

c := proc (k) if k = 0 then return b(0)^N else return (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0)) end if end proc

proc (k) if k = 0 then return b(0)^N else return (sum((q*(N+1)-k)*b(q)*c(k-q), q = 1 .. k))/(k*b(0)) end if end proc

 (5)
> 

c(1)

Error, (in _factorial) too many levels of recursion

  
> 

F := proc (s, kmax, N) options operator, arrow; sum(c(k)*s^k, k = 0 .. kmax) end proc

proc (s, kmax, N) options operator, arrow; sum(c(k)*s^k, k = 0 .. kmax) end proc

 (6)
> 

F(1, 2, 2)

Error, (in unknown) too many levels of recursion

  

NULL


 

Download Recursion.mw

Page 1 of 1