Search Results for ""

For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...

A nonnegative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonnegative number, i.e., a_(ij)>=0 for all i, j. Nonnegative matrices are ...

The term "parameter" is used in a number of ways in mathematics. In general, mathematical functions may have a number of arguments. Arguments that are typically varied when ...

"Stampacchia's theorem" is a name given to any number of related results in functional analysis, and while the body of the theorem often varies depending on the literature ...