TOPICS
Search

Search Results for ""


111 - 120 of 572 for Inline 36Search Results
Consider the family of ellipses (x^2)/(c^2)+(y^2)/((1-c)^2)-1=0 (1) for c in [0,1]. The partial derivative with respect to c is -(2x^2)/(c^3)+(2y^2)/((1-c)^3)=0 (2) ...
The series sumf(n) for a monotonic nonincreasing f(x) is convergent if lim_(x->infty)^_(e^xf(e^x))/(f(x))<1 and divergent if lim_(x->infty)__(e^xf(e^x))/(f(x))>1.
A Euclidean motion of R^n is an affine transformation whose linear part is an orthogonal transformation.
Let a, b, and k be integers with k>=1. For j=0, 1, 2, let S_j=sum_(i=j (mod 3))(-1)^i(k; i)a^(k-i)b^i. Then 2(a^2+ab+b^2)^(2k)=(S_0-S_1)^4+(S_1-S_2)^4+(S_2-S_0)^4.
The inverse of the Laplace transform F(t) = L^(-1)[f(s)] (1) = 1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds (2) f(s) = L[F(t)] (3) = int_0^inftyF(t)e^(-st)dt. (4)
Let the opposite sides of a convex cyclic hexagon be a, a^', b, b^', c, and c^', and let the polygon diagonals e, f, and g be so chosen that a, a^', and e have no common ...
In population studies, the direct offspring of a reference population (roughly) constitutes a single generation. For a cellular automaton, the fundamental unit of time during ...
The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).
The dual of the great rhombihexahedron U_(21) and Wenninger dual W_(103).
If two pairs of opposite polygon vertices of a complete quadrilateral are pairs of harmonic conjugate points, then the third pair of opposite polygon vertices is likewise a ...
1 ... 9|10|11|12|13|14|15 ... 58 Previous Next

...