Search Results for ""

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 ...

In statistics, sampling is the selection and implementation of statistical observations in order to estimate properties of an underlying population. Sampling is a vital part ...

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

The Schroeder stairs, also called Schouten's staircase (Bool et al. 1982, p. 147), are an ambiguous figure that depicts two different staircases at the same time: one going ...