Search Results for ""

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...

There are several results known as the Morgado identity. The first is (1) where F_n is a Fibonacci number and L_n is a Lucas number (Morgado 1987, Dujella 1995). A second ...

If a and b are integers not both equal to 0, then there exist integers u and v such that GCD(a,b)=au+bv, where GCD(a,b) is the greatest common divisor of a and b.

sum_(k=-n)^n(-1)^k(n+b; n+k)(n+c; c+k)(b+c; b+k)=(Gamma(b+c+n+1))/(n!Gamma(b+1)Gamma(c+1)), where (n; k) is a binomial coefficient and Gamma(x) is a gamma function.

The identity element I (also denoted E, e, or 1) of a group or related mathematical structure S is the unique element such that Ia=aI=a for every element a in S. The symbol ...

The map which assigns every member of a set A to the same element id_A. It is identical to the identity function.

The operator I^~ which takes a real number to the same real number I^~r=r.

The identity (xy)x^2=x(yx^2) satisfied by elements x and y in a Jordan algebra.

The dilogarithm identity Li_2(-x)=-Li_2(x/(1+x))-1/2[ln(1+x)]^2.

Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...