Search Results for ""

The solution u(x,y)=int_0^xdxiint_1^yR(xi,eta;x,y)f(xi,eta)deta, where R(x,y;xieta) is the Riemann function of the linear Goursat problem with characteristics phi=psi=0 ...

A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...

The identity PVint_(-infty)^inftyF(phi(x))dx=PVint_(-infty)^inftyF(x)dx (1) holds for any integrable function F(x) and phi(x) of the form ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

Let Xi be the xi-function defined by Xi(iz)=1/2(z^2-1/4)pi^(-z/2-1/4)Gamma(1/2z+1/4)zeta(z+1/2). (1) Xi(z/2)/8 can be viewed as the Fourier transform of the signal ...

The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

An integer n>1 is said to be highly cototient if the equation x-phi(x)=n has more solutions than the equations x-phi(x)=k for all 1<k<n, where phi is the totient function. ...

A game played with two heaps of counters in which a player may take any number from either heap or the same number from both. The player taking the last counter wins. The rth ...

The integral transform defined by (Kphi)(x)=int_0^inftyG_(pq)^(mn)(xt|(a_p); (b_q))phi(t)dt, where G_(pq)^(mn) is a Meijer G-function. Note the lower limit of 0, not -infty ...