TOPICS
Search

Search Results for ""


2611 - 2620 of 3632 for Diophantine Equation 2nd PowersSearch Results
A linkage which draws the inverse of a given curve. It can also convert circular to linear motion. The rods satisfy AB=CD and BC=DA, and O, P, and P^' remain collinear while ...
The hat is a caret-shaped symbol commonly placed on top of variables to give them special meaning. The symbol x^^ is voiced "x-hat" (or sometimes as "x-roof") in mathematics, ...
The axioms formulated by Hausdorff (1919) for his concept of a topological space. These axioms describe the properties satisfied by subsets of elements x in a neighborhood ...
A family of operators mapping each space M_k of modular forms onto itself. For a fixed integer k and any positive integer n, the Hecke operator T_n is defined on the set M_k ...
A Hessenberg matrix is a matrix of the form [a_(11) a_(12) a_(13) ... a_(1(n-1)) a_(1n); a_(21) a_(22) a_(23) ... a_(2(n-1)) a_(2n); 0 a_(32) a_(33) ... a_(3(n-1)) a_(3n); 0 ...
A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...
The 21 assumptions which underlie the geometry published in Hilbert's classic text Grundlagen der Geometrie. The eight incidence axioms concern collinearity and intersection ...
Let 1/p+1/q=1 (1) with p, q>1. Then Hölder's inequality for integrals states that int_a^b|f(x)g(x)|dx<=[int_a^b|f(x)|^pdx]^(1/p)[int_a^b|g(x)|^qdx]^(1/q), (2) with equality ...
Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...
Let b_1=1 and b_2=2 and for n>=3, let b_n be the least integer >b_(n-1) which can be expressed as the sum of two or more consecutive terms. The resulting sequence is 1, 2, 3, ...
1 ... 259|260|261|262|263|264|265 ... 364 Previous Next

...