TOPICS
Search

Search Results for ""


2691 - 2700 of 13135 for visualized mathematicsSearch Results
A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...
A curve named after James Watt (1736-1819), the Scottish engineer who developed the steam engine (MacTutor Archive). The curve is produced by a linkage of rods connecting two ...
A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), .... Then Weddle's rule approximating the integral of ...
A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Woolhouse's formulas ...
x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).
A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...
The version of set theory obtained if Axiom 6 of Zermelo-Fraenkel set theory is replaced by 6'. Selection axiom (or "axiom of subsets"): for any set-theoretic formula A(u), ...
In this illusion, the vertical lines in the above figure are parallel, but appear to be tilted at an angle. In 1860, F. Zöllner sent his discovery in a letter to physicist ...
1 ... 267|268|269|270|271|272|273 ... 1314 Previous Next

...