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.

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

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 ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

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 ...