Search Results for ""
1761 - 1770 of 2028 for Regularized SumSearch Results
When referring to a planar object, "free" means that the object is regarded as capable of being picked up out of the plane and flipped over. As a result, mirror images are ...
A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...
The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...
The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...
The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...
On the surface of a sphere, attempt separation of variables in spherical coordinates by writing F(theta,phi)=Theta(theta)Phi(phi), (1) then the Helmholtz differential ...
An identity is a mathematical relationship equating one quantity to another (which may initially appear to be different).
The incentral triangle DeltaI_AI_BI_C is the Cevian triangle of a triangle DeltaABC with respect to its incenter I. It is therefore also the triangle whose vertices are ...
An infinitesimal transformation of a vector r is given by r^'=(I+e)r, (1) where the matrix e is infinitesimal and I is the identity matrix. (Note that the infinitesimal ...
An interprime is the average of consecutive (but not necessarily twin) odd primes. The first few terms are 4, 6, 9, 12, 15, 18, 21, 26, 30, 34, ... (OEIS A024675). The first ...
...
View search results from all Wolfram sites (34630 matches)

