Search Results for ""

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A formal argument in logic in which it is stated that (1) P=>Q and R=>S (where => means "implies"), and (2) either P or R is true, from which two statements it follows that ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

A hypergeometric function in which one parameter changes by +1 or -1 is said to be contiguous. There are 26 functions contiguous to _2F_1(a,b;c;x) taking one pair at a time. ...

A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'

For a simple continued fraction x=[a_0,a_1,...] with convergents p_n/q_n, the fundamental recurrence relation is given by p_nq_(n-1)-p_(n-1)q_n=(-1)^(n+1).

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

The property of being continuous.

A correction to a discrete binomial distribution to approximate a continuous distribution. P(a<=X<=b) approx P((a-1/2-np)/(sqrt(np(1-p)))<=z<=(b+1/2-np)/(sqrt(np(1-p)))), ...