Search Results for ""

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

A Banach space X is called prime if each infinite-dimensional complemented subspace of X is isomorphic to X (Lindenstrauss and Tzafriri 1977). Pełczyński (1960) proved that ...

A grouping of statistics.

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

A group given by G/phi(G), where phi(G) is the Frattini subgroup of a given group G.

The polynomials in the diagonal of the Smith normal form or rational canonical form of a matrix are called its invariant factors.

The distance a point moves due to shear divided by the perpendicular distance of a point from the invariant line.

An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.