Search Results for ""
831 - 840 of 1136 for turbulence image gallerySearch Results

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...
Whirls are figures constructed by nesting a sequence of polygons (each having the same number of sides), each slightly smaller and rotated relative to the previous one. The ...
There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...
A figure used in many Asian cultures to symbolize the unity of the two "opposite" female and male elements, the "yin" and "yang." The solid and hollow parts composing the ...
Let f be a real-valued, continuous, and strictly increasing function on [0,c] with c>0. If f(0)=0, a in [0,c], and b in [0,f(c)], then int_0^af(x)dx+int_0^bf^(-1)(x)dx>=ab, ...
The identity element of an additive monoid or group or of any other algebraic structure (e.g., ring, module, abstract vector space, algebra) equipped with an addition. It is ...
A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...
Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...
The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...
A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

...