Search Results for ""

Campbell (2022) used the WZ method to obtain the sum (pi^2)/4=sum_(n=1)^infty(16^n(n+1)(3n+1))/(n(2n+1)^2(2n; n)^3), (1) where (n; k) is a binomial coefficient. There is a ...

The integral kernel in the Poisson integral, given by K(psi)=1/(2pi)(1-|z_0|^2)/(|z_0-e^(ipsi)|^2) (1) for the open unit disk D(0,1). Writing z_0=re^(itheta) and taking ...

The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...

A polynomial given in terms of the Neumann polynomials O_n(x) by S_n(x)=(2xO_n(x)-2cos^2(1/2npi))/n.