Search Results for ""

The cubic formula is the closed-form solution for a cubic equation, i.e., the roots of a cubic polynomial. A general cubic equation is of the form z^3+a_2z^2+a_1z+a_0=0 (1) ...

The group C_2 is the unique group of group order 2. C_2 is both Abelian and cyclic. Examples include the point groups C_s, C_i, and C_2, the integers modulo 2 under addition ...

C_3 is the unique group of group order 3. It is both Abelian and cyclic. Examples include the point groups C_3, C_(3v), and C_(3h) and the integers under addition modulo 3 ...

C_5 is the unique group of group order 5, which is Abelian. Examples include the point group C_5 and the integers mod 5 under addition (Z_5). No modulo multiplication group ...

C_6 is one of the two groups of group order 6 which, unlike D_3, is Abelian. It is also a cyclic. It is isomorphic to C_2×C_3. Examples include the point groups C_6 and S_6, ...

C_7 is the cyclic group that is the unique group of group order 7. Examples include the point group C_7 and the integers modulo 7 under addition (Z_7). No modulo ...

A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

Let a be the angle between v and x, b the angle between v and y, and c the angle between v and z. Then the direction cosines are equivalent to the (x,y,z) coordinates of a ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...