Search Results for ""

The number 13.

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

A negative number multiplied by another negative number gives a positive number.

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

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

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 binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

Legendre's conjecture asserts that for every n there exists a prime p between n^2 and (n+1)^2 (Hardy and Wright 1979, p. 415; Ribenboim 1996, pp. 397-398). It is one of ...

A figurate number which is equal to the cubic number n^3. The first few are 1, 8, 27, 64, ... (OEIS A000578).