Search Results for ""

The method of exhaustion was an integral-like limiting process used by Archimedes to compute the area and volume of two-dimensional lamina and three-dimensional solids.

Let R be a plane region bounded above by a continuous curve y=f(x), below by the x-axis, and on the left and right by x=a and x=b, then the volume of the solid of revolution ...

Let f and g be nonnegative and continuous functions on the closed interval [a,b], then the solid of revolution obtained by rotating the curves f(x) and g(x) about the x-axis ...

Given a metric g_(alphabeta), the discriminant is defined by g = det(g_(alphabeta)) (1) = |g_(11) g_(12); g_(21) g_(22)| (2) = g_(11)g_(22)-(g_(12))^2. (3) Let g be the ...

Also known as Kolmogorov entropy, Kolmogorov-Sinai entropy, or KS entropy. The metric entropy is 0 for nonchaotic motion and >0 for chaotic motion.

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

A derived polygon with side ratios chosen as r=1/2 so that inscribed polygons are constructed by connecting the midpoints of the base polygon. For a triangle P, the ...

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...