Search Results for ""

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

The W-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. The first few Fermat polynomials are F_1(x) = 1 (1) F_2(x) = 3x (2) F_3(x) = ...

Let r be the correlation coefficient. Then defining z^'=tanh^(-1)r (1) zeta=tanh^(-1)rho, (2) gives sigma_(z^') = (N-3)^(-1/2) (3) var(z^') = 1/n+(4-rho^2)/(2n^2)+... (4) ...

G = int_0^infty(e^(-u))/(1+u)du (1) = -eEi(-1) (2) = 0.596347362... (3) (OEIS A073003), where Ei(x) is the exponential integral. Stieltjes showed it has the continued ...

The only irreducible spherical simplexes generated by reflection are A_n (n>=1), B_n (n>=4), C_n (n>=2), D_2^p (p>=5), E_6, E_7, E_8, F_4, G_3, and G_4. The only irreducible ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

Number theory is a vast and fascinating field of mathematics, sometimes called "higher arithmetic," consisting of the study of the properties of whole numbers. Primes and ...

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...

A puzzle in which one object is to be converted to another by making a finite number of cuts and reassembling it. The cuts are often, but not always, restricted to straight ...