TOPICS
Search

Search Results for ""


1361 - 1370 of 5719 for Numbered Equation 6Search Results
Given the binary quadratic form ax^2+2bxy+cy^2 (1) with polynomial discriminant b^2-ac, let x = pX+qY (2) y = rX+sY. (3) Then a(pX+qY)^2+2b(pX+qY)(rX+sY)+c(rX+sY)^2 ...
Let a triangle have angles A, B, and C, then inequalities include sinA+sinB+sinC<=3/2sqrt(3) (1) 1<=cosA+cosB+cosC<=3/2 (2) sin(1/2A)sin(1/2B)sin(1/2C)<=1/8 (3) ...
Values of the trigonometric functions can be expressed exactly for integer multiples of pi/20. For cosx, cos(pi/(20)) = 1/4sqrt(8+2sqrt(10+2sqrt(5))) (1) cos((3pi)/(20)) = ...
The polyhedron compound of the truncated dodecahedron and its dual, the triakis icosahedron. The compound can be constructed from a truncated dodecahedron of unit edge length ...
The polyhedron compound of the truncated icosahedron and its dual, the pentakis dodecahedron. The compound can be constructed from a truncated icosahedron of unit edge length ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...
If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...
Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...
A series of the form sum_(k=1)^infty(-1)^(k+1)a_k (1) or sum_(k=1)^infty(-1)^ka_k, (2) where a_k>0. A series with positive terms can be converted to an alternating series ...
1 ... 134|135|136|137|138|139|140 ... 572 Previous Next

...