Search Results for ""

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

The Copeland-Erdős constant is the constant with decimal expansion 0.23571113171923... (OEIS A033308) obtained by concatenating consecutive primes: 2, 23, 235, 2357, 235711, ...

The curve formed by the intersection of a cylinder and a sphere is known as Viviani's curve. The problem of finding the lateral surface area of a cylinder of radius r ...

Adding a damping force proportional to x^. to the equation of simple harmonic motion, the first derivative of x with respect to time, the equation of motion for damped simple ...

The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...

A curve also known as the Gerono lemniscate. It is given by Cartesian coordinates x^4=a^2(x^2-y^2), (1) polar coordinates, r^2=a^2sec^4thetacos(2theta), (2) and parametric ...

A method for solving an equation by approximating continuous quantities as a set of quantities at discrete points, often regularly spaced into a so-called grid or mesh. ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The Gergonne point Ge is the perspector of a triangle DeltaABC and its contact triangle DeltaT_AT_BT_C. It has equivalent triangle center functions alpha = [a(b+c-a)]^(-1) ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...