While answering a question on this site I accidentally met expressions of the form binomial(n, min(n, r)+1) where both n and r are positive integers and n is strictly lower than r.

For the record the common definition of the binomial coefficient binomial(n, k) is based on the double inequality 0 <= k <= n  and the only generalized definition where k could be larger than n I know of is the NegativeBinomial distribution where we use
binomial(-n, k) which, with 0 <= k <= n  again makes the first operator lower than the second.

I tried to understand how Maple does this

binomial(n, min(n, r)+1) assuming n < r,  n::posint
                               0

(more generallyn, for any strictly positive integer p, binomial(n, min(n, r)+p) = 0 under the assumptions above)

I guess that the explanationrelies upon what I did to get the output (2) in the attached file.
Can you confirm/infirm this and, as I wasn't capable to find any clue in help(binomial), [Maple 2015], if the way maple computes
these results is documented elsewhere.

Thanks in advence.

Download binomial.mw

Maple Transactions frequently gets submissions that contain Maple code.  The papers (or videos, or Maple documents, or Jupyter notebooks) that we get are, if the author wants a refereed submission, sent to referees by a fairly usual academic process.  We look for well-written papers on topics of interest to the Maple community.

But we could use some help in reviewing code, for some of the submissions.  Usually the snippets are short, but sometimes the packages involved are more substantial.

If you would be interested in having your name on the list of potential code reviewers, please email me (or Paulina Chin, or Jürgen Gerhard) and we will gratefully add you.  You might not get called on immediately---it depends on what we have in the queue.

Thank you very much, in advance, for sharing your expertise.

Rob

the maple document is  p151.mw

Hi everyone, I'm trying to do some simple algebraic simplification operations and run into algsubs replacement failures,

 the symbol σ' is typed in this way:  σ +  prime (left Palettes -> Common Symbols -> prime) + (selecting σ'  and  press  Ctrl+Shift+A  make it  a  atomic variable) 

I'm new to this, any help or suggestion is welcome, thanks! 

Good day to all of you friends, just asking for your kind help.

I have been trying to get solution of the next integral but didn't have succes. The goal of the code is to perfom a variable change.

Best regards

Download maple_primes_question.mw

We can see a list of functions for a package in the documentation, for example the package GroupTheory:

Is there a code based way to see all the functions in this package?

How  to make the integration 

into the following form:

Thanks in advance,Q1.mw

Boundary condition of my problem is   f(0) =1  and  d(f)(1) = -(k[f]/k[nf])*Bi*f(1).

But i am getting error when solve this.How to clear this .

my attached file is,

HNF_1.mw

Dear Users!

I hope everyone is fine here. In the attached file I have solved a partial differential equation using the finite difference method for different mesh in spatial directions (i.e., for different Mx). I want to compute the time and memory to compute the solution against each Mx and want to plot it. Kindly help me how to compute the time and memory for each value of Mx.

TIME.mw

I shall be waiting. Thanks in advance. 

Hello

I would like to compare the digits of two natural numbers p and q first. Then I would like to omit in p and q the digits which they have in common.

Example: p=2345, q=1536

the common digits are 3 and 5. omitted them in both numbers, it will result p'=24 and q'=16.

Thanks for your help!

Here is an example where IntegrationTools:-Combine does not seem capable to combine two integrals whose lower bounds are -infinity (same situation holds where upper bounds equal to +infinity).

Is there a way to Combine(J1) without using the J3 workaround?
Is there any mathematical reason why Combine(J1) does not work or it is due to the way Maple handles infinity?

Thanks in advance.

IntegrationTools_Combine.mw

IsFrobeniusGroup(SmallGroup(20, 3)) will get true, but IsFrobeniusPermGroup(SmallGroup(20, 3)) will get false. What happen? As the documentation, it will get same result:

The two definitions are equivalent in the following sense.  If G is a Frobenius permutation group, then G is Frobenius as an abstract group

I have the following double integral:

In the above integral, r and sigma are the random variables: r is distributed normally with a mean and standard deviation equal to sigma, which is a random variable by itself (k near sigma in integral is a known parameter). Sigma is distributed lognormally, with a known mean and standard deviation. The probability density function of the sigma is defined by f_s(sigma) in the above integral. How is it possible to solve this integral in Maple?

Thanks in advance 

I want a maple code to solve the caputo fabrizio differential equations using Runge Kutta method with implicit functions and impulsive conditions in maple. Is there any code structure for that. 

restart;
with(Student[NumericalAnalysis]);
with(plots);
with(DEtools);
f := proc(u, r) local res; res := 1/25*r^2 + (sin(u(r)) + sin(diff(u(r), [r $ 1/5])))/(r^2 + 47); return res; end proc;

RK4 := proc(f, u0, r0, h, n) local u, r, i, k1, k2, k3, k4; u := Vector(n + 1); r := Vector(n + 1); u[1] := u0; r[1] := r0; for i to n do k1 := f(u[i], t[i]); k2 := f(u[i] + 1/2*h*k1, r[i] + 1/2*h); k3 := f(u[i] + 1/2*h*k2, r[i] + 1/2*h); k4 := f(u[i] + h*k3, r[i] + h); u[i + 1] := u[i] + 1/6*h*(k1 + 2*k2 + 2*k3 + k4); r[i + 1] := r[i] + h; end do; return [u, r]; end proc;
RK4 := proc (f, u0, r0, h, n) local u, r, i, k1, k2, k3, k4; u 

   := Vector(n+1); r := Vector(n+1); u[1] := u0; r[1] := r0; 

   for i to n do k1 := f(u[i], t[i]); k2 := f(u[i]+(1/2)*h*k1, 

   r[i]+(1/2)*h); k3 := f(u[i]+(1/2)*h*k2, r[i]+(1/2)*h); k4 := 

   f(u[i]+h*k3, r[i]+h); u[i+1] := u[i]+(1/6)*h*(k1+2*k2+2*k3+k4\

  ); r[i+1] := r[i]+h end do; return [u, r] end proc

u0 := cos(abs(0.9))/15;
                      u0 := 0.04144066455

r0 := 0;
                            r0 := 0

h := 0.1;
                            h := 0.1

n := 100;
                            n := 100

solution := RK4(f, u0, r0, h, n)

u := solution[1];
r := solution[2];
plot(u, r, style = line, color = blue, labels = ["Time (r)", "Solution (u)"]);
 is this correct to solve the implicit fractional differential equations using 4th order Runge-Kutta Method. will fsolve command  solve the fractional differential equations ?

Hello
i am using maple 2023 and the physics package and have the following question:
I want to define a gauge-  plus coordinate covariant derivative i.e.
assuming i,j,k are SO(3) indices and greek indices describe 4-dim space-time (not necessary flat)
i need the following derivative:

D_sigma F_i _rho _lambda = nabla_sigma F_i _rho _lambda + epsilon_i ^j ^k  A_j_sigma  F_k~rho~lambda
with _ meaning lower indices and ^ upper indices and nabla the convenient coordinate covariant derivative of general relativity.
F is a tensor objekt with 2 space time indices and 1 so(3) indices (e.g. Yang Mills field strength) and A is the so(3)gauge potential
How can i define this Differentialoperator with the physics package.
I.e. i want to work with SO(3) Yang-Mills Fields in curved space time and need this generalized Differentialoperator
thanks for helping. I hope its clear from this ascii text in the screen
regards Michael