Search Results for ""

A curve is simple if it does not cross itself.

Interest which is paid only on the principal and not on the additional amount generated by previous interest payments. A formula for computing simple interest is ...

A simple path is a path which is a simple curve. More precisely, a continuous mapping gamma:[a,b]->C^0 is a simple path if it has no self-intersections. Here, C^0 denotes the ...

A simple pole of an analytic function f is a pole of order one. That is, (z-z_0)f(z) is an analytic function at the pole z=z_0. Alternatively, its principal part is c/(z-z_0) ...

A nonzero ring S whose only (two-sided) ideals are S itself and zero. Every commutative simple ring is a field. Every simple ring is a prime ring.

A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

If a line L is the Simson line of a point P on the circumcircle of a triangle, then P is called the pole of L (Honsberger 1995, p. 128).

A finite set of equations in the same unknowns of which the common solutions have to be determined. Solution of simultaneous equations in implemented in the Wolfram Language ...