TOPICS
Search

Search Results for ""


81 - 90 of 120 for Inline 74Search Results
A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...
The Johnson solids are the convex polyhedra having regular faces and equal edge lengths (with the exception of the completely regular Platonic solids, the "semiregular" ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
The Bessel functions of the first kind J_n(x) are defined as the solutions to the Bessel differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0 (1) which are ...
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) ...
As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...
An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...
If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...
A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...
An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...
1 ... 6|7|8|9|10|11|12 Previous Next

...