TOPICS
Search

Search Results for ""


181 - 190 of 787 for Logic, reasoning, and proofsSearch Results
The hexagon obtained from an arbitrary hexagon by connecting the centroids of each consecutive three sides. This hexagon has equal and parallel sides (Wells 1991). A proof of ...
A proving technique in homological algebra which consists in looking for equivalent map compositions in commutative diagrams, and in exploiting the properties of injective, ...
Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...
A generalization of Fermat's little theorem. Euler published a proof of the following more general theorem in 1736. Let phi(n) denote the totient function. Then a^(phi(n))=1 ...
Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...
Let Gamma be a representation for a group of group order h, then sum_(R)Gamma_i(R)_(mn)Gamma_j(R)_(m^'n^')^*=h/(sqrt(l_il_j))delta_(ij)delta_(mm^')delta_(nn^'). The proof is ...
Let a_n>=0 and suppose sum_(n=1)^inftya_ne^(-an)∼1/a as a->0^+. Then sum_(n<=x)a_n∼x as x->infty. This theorem is a step in the proof of the prime number theorem, but has ...
Let A = [B D; E C] (1) A^(-1) = [W X; Y Z], (2) where B and W are k×k matrices. Then det(Z)det(A)=det(B). (3) The proof follows from equating determinants on the two sides of ...
The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...
There exist lattices in n dimensions having hypersphere packing densities satisfying eta>=(zeta(n))/(2^(n-1)), where zeta(n) is the Riemann zeta function. However, the proof ...
1 ... 16|17|18|19|20|21|22 ... 79 Previous Next

...