Search Results for ""

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

Somewhere on the Earth, there is a pair of antipodal points having simultaneously the same temperature and pressure.

A particular way of doing something, sometimes also called an algorithm or procedure. (According to Petkovšek et al. (1996), "a method is a trick that has worked at least ...

Let f be a nonnegative and continuous function on the closed interval [a,b], then the solid of revolution obtained by rotating the curve f(x) about the x-axis from x=a to x=b ...

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

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.