Search Results for ""

An apex graph is a graph possessing at least one vertex whose removal results in a planar graph. The set of vertices whose removal results in a planar graph is known as the ...

Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...

The function [x] which gives the smallest integer >=x, shown as the thick curve in the above plot. Schroeder (1991) calls the ceiling function symbols the "gallows" because ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

Two circles may intersect in two imaginary points, a single degenerate point, or two distinct points. The intersections of two circles determine a line known as the radical ...

A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...

The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...

The 10.1.2 equation A^(10)=B^(10)+C^(10) (1) is a special case of Fermat's last theorem with n=10, and so has no solution. No 10.1.n solutions are known with n<13. A 10.1.13 ...

The 8.1.2 equation A^8+B^8=C^8 (1) is a special case of Fermat's last theorem with n=8, and so has no solution. No 8.1.3, 8.1.4, 8.1.5, 8.1.6, or 8.1.7 solutions are known. ...