Search Results for ""

The exponent is the component of a finite floating-point representation that signifies the integer power to which the radix is raised in determining the value of that ...

The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of ...

Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...

A polygonal number and 6-polygonal number of the form n(2n-1). The first few are 1, 6, 15, 28, 45, ... (OEIS A000384). The generating function for the hexagonal numbers is ...

The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...

A modified spherical Bessel function of the first kind (Abramowitz and Stegun 1972), also called a "spherical modified Bessel function of the first kind" (Arfken 1985), is ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

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

Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...

The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...