Search Results for ""

Let P(E_i) be the probability that E_i is true, and P( union _(i=1)^nE_i) be the probability that at least one of E_1, E_2, ..., E_n is true. Then "the" Bonferroni ...

Every Boolean algebra is isomorphic to the Boolean algebra of sets. The theorem is equivalent to the maximal ideal theorem, which can be proved without using the axiom of ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...

The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...

A magic square that remains magic when its border is removed. A nested magic square remains magic after the border is successively removed one ring at a time. An example of a ...

There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...

The great success mathematicians had studying hypergeometric functions _pF_q(a_1,...,a_p;b_1,...,b_q;z) for the convergent cases (p<=q+1) prompted attempts to provide ...

Let S_n be the set of permutations of {1, 2, ..., n}, and let sigma_t be the continuous time random walk on S_n that results when randomly chosen transpositions are performed ...

The term Borel hierarchy is used to describe a collection of subsets of R defined inductively as follows: Level one consists of all open and closed subsets of R, and upon ...

A Borel set is an element of a Borel sigma-algebra. Roughly speaking, Borel sets are the sets that can be constructed from open or closed sets by repeatedly taking countable ...