Search Results for ""

A quantity which is either 0 (zero) or positive, i.e., >=0.

Euclidean n-space is denoted R^n.

It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...

The exponential factorial is defined by the recurrence relation a_n=n^(a_(n-1)), (1) where a_0=1. The first few terms are therefore a_1 = 1 (2) a_2 = 2^1=2 (3) a_3 = ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...