Search Results for ""

The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...

Given rods of length 1, 2, ..., n, how many distinct triangles T(n) can be made? Lengths for which l_i>=l_j+l_k (1) obviously do not give triangles, but all other ...

A sequence of random variates X_0, X_1, ... is called absolutely fair if for n=1, 2, ..., <X_1>=0 and <X_(n+1)|X_1,...,X_n>=0 (Feller 1971, p. 210).

An operator A^~ is said to be antiunitary if it satisfies: <A^~f_1|A^~f_2> = <f_1|f_2>^_ (1) A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (2) A^~cf(x) = c^_A^~f(x), (3) where ...

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

The point of concurrence S of a triangle's cleavers M_1C_1, M_2C_2, and M_3C_3, which is simply the Spieker center, i.e., the incenter of the medial triangle DeltaM_1M_2M_3 ...

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...

A generalization of the hypergeometric function identity (1) to the generalized hypergeometric function _3F_2(a,b,c;d,e;x). Darling's products are (2) and (3) which reduce to ...

The prime link 02-0201 which has Jones polynomial V(t)=-t-t^(-1) and HOMFLY polynomial P(z,alpha)=z^(-1)(alpha^(-1)-alpha^(-3))+zalpha^(-1). It has braid word sigma_1^2.