Search Results for ""
1011 - 1020 of 13135 for Simple probabilitySearch Results

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 ...
Let a, b, and c be the lengths of the legs of a triangle opposite angles A, B, and C. Then the law of cosines states a^2 = b^2+c^2-2bccosA (1) b^2 = a^2+c^2-2accosB (2) c^2 = ...
A transformation of the form w=f(z)=(az+b)/(cz+d), (1) where a, b, c, d in C and ad-bc!=0, (2) is a conformal mapping called a linear fractional transformation. The ...
A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...
Lissajous curves are the family of curves described by the parametric equations x(t) = Acos(omega_xt-delta_x) (1) y(t) = Bcos(omega_yt-delta_y), (2) sometimes also written in ...
Let P, Q be integers satisfying D=P^2-4Q>0. (1) Then roots of x^2-Px+Q=0 (2) are a = 1/2(P+sqrt(D)) (3) b = 1/2(P-sqrt(D)), (4) so a+b = P (5) ab = 1/4(P^2-D) (6) = Q (7) a-b ...
The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...
The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...
The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...
A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...

...