Search Results for ""

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...

A conjecture due to M. S. Robertson in 1936 which treats a univalent power series containing only odd powers within the unit disk. This conjecture implies the Bieberbach ...

Let f be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then if f(a)=f(b), then there is at least one point c in (a,b) where f^'(c)=0. ...

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

Let k>=0 and n>=2 be integers. A SOMA, or more specifically a SOMA(k,n), is an n×n array A, whose entries are k-subsets of a kn-set Omega, such that each element of Omega ...

A sample is a subset of a population that is obtained through some process, possibly random selection or selection based on a certain set of criteria, for the purposes of ...

When computing the sample variance s numerically, the mean must be computed before s^2 can be determined. This requires storing the set of sample values. However, it is ...