Search Results for ""

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

The Lehmer mean of a set of n numbers {a_k}_(k=1)^n is defined by L_p(a_1,...,a_n)=(sum_(k=1)^(n)a_k^p)/(sum_(k=1)^(n)a_k^(p-1)) (Havil 2003, p. 121).

The function defined by [n]_q = [n; 1]_q (1) = (1-q^n)/(1-q) (2) for integer n, where [n; k]_q is a q-binomial coefficient. The q-bracket satisfies lim_(q->1^-)[n]_q=n. (3)

The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...

The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...

A Lambert series is a series of the form F(x)=sum_(n=1)^inftya_n(x^n)/(1-x^n) (1) for |x|<1. Then F(x) = sum_(n=1)^(infty)a_nsum_(m=1)^(infty)x^(mn) (2) = ...

A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...

A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...

A method for finding roots which defines P_j(x)=(P(x))/((x-x_1)...(x-x_j)), (1) so the derivative is (2) One step of Newton's method can then be written as ...

Infinity, most often denoted as infty, is an unbounded quantity that is greater than every real number. The symbol infty had been used as an alternative to M (1000) in Roman ...