Search Results for ""

An even number is an integer of the form n=2k, where k is an integer. The even numbers are therefore ..., -4, -2, 0, 2, 4, 6, 8, 10, ... (OEIS A005843). Since the even ...

Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...

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 ...

A general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 for y!=0 a function on the tangent bundle T(M), and homogeneous of degree 1 in y. ...

Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

An equation of the form f(x,y,...)=0, where f contains a finite number of independent variables, known functions, and unknown functions which are to be solved for. Many ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...