TOPICS
Search

Search Results for ""


1201 - 1210 of 1392 for Prime GapsSearch Results
The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...
A number n for which the harmonic mean of the divisors of n, i.e., nd(n)/sigma(n), is an integer, where d(n)=sigma_0(n) is the number of positive integer divisors of n and ...
The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...
Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...
Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...
An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...
A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...
The MacBeath inconic of a triangle is the inconic with parameters x:y:z=a^2cosA:b^2cosB:c^2cosC. (1) Its foci are the circumcenter O and the orthocenter H, giving the center ...
The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...
The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...
1 ... 118|119|120|121|122|123|124 ... 140 Previous Next

...