Search Results for ""

A uniquely complemented lattice is a complemented lattice (L, ^ , v ,0,1,^') that satisfies ( forall x in L)( forall y in L)[(x ^ y=0) ^ (x v y=1)]=>y=x^'. The class of ...

The base-20 notational system for representing real numbers. The digits used to represent numbers using vigesimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, ...

A horizontal line placed above multiple quantities to indicate that they form a unit. It is most commonly used to denote 1. A radical (sqrt(12345)), 2. Repeating decimals ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

If (1+xsin^2alpha)sinbeta=(1+x)sinalpha, then (1+x)int_0^alpha(dphi)/(sqrt(1-x^2sin^2phi))=int_0^beta(dphi)/(sqrt(1-(4x)/((1+x)^2)sin^2phi)).

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...

There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...

The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...