Search Results for ""
1021 - 1030 of 2514 for Kroneckers Approximation TheoremSearch Results
The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...
The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...
A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...
The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...
A Wieferich prime is a prime p which is a solution to the congruence equation 2^(p-1)=1 (mod p^2). (1) Note the similarity of this expression to the special case of Fermat's ...
Angle trisection is the division of an arbitrary angle into three equal angles. It was one of the three geometric problems of antiquity for which solutions using only compass ...
A parallelian is a line drawn parallel to one side of a triangle. The three lines drawn through a given point are known as the triangle's parallelians. There exists a unique ...
An isosceles trapezoid (called an isosceles trapezium by the British; Bronshtein and Semendyayev 1997, p. 174) is trapezoid in which the base angles are equal and therefore ...
If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...
The Riemann-Lebesgue Lemma, sometimes also called Mercer's theorem, states that lim_(n->infty)int_a^bK(lambda,z)Csin(nz)dz=0 (1) for arbitrarily large C and "nice" ...
...
View search results from all Wolfram sites (10582 matches)

