Search Results for ""

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

There are a number of formulas variously known as Hurwitz's formula. The first is zeta(1-s,a)=(Gamma(s))/((2pi)^s)[e^(-piis/2)F(a,s)+e^(piis/2)F(-a,s)], where zeta(z,a) is a ...

Hypothesis testing is the use of statistics to determine the probability that a given hypothesis is true. The usual process of hypothesis testing consists of four steps. 1. ...

A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

In general, it is possible to link two n-dimensional hyperspheres in (n+2)-dimensional space in an infinite number of inequivalent ways. In dimensions greater than n+2 in the ...

There are a number of functions in mathematics commonly denoted with a Greek letter lambda. Examples of one-variable functions denoted lambda(n) with a lower case lambda ...

Let L denote the n×n square lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L such ...

The product C of two matrices A and B is defined as c_(ik)=a_(ij)b_(jk), (1) where j is summed over for all possible values of i and k and the notation above uses the ...

The negadecimal representation of a number n is its representation in base -10 (i.e., base negative 10). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...