Search Results for ""

A method which can be used to solve any quadratic congruence equation. This technique relies on the fact that solving x^2=b (mod p) is equivalent to finding a value y such ...

A curve on which points of a map z_n (such as the Mandelbrot set) diverge to a given value r_(max) at the same rate. A common method of obtaining lemniscates is to define an ...

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

The evolute of a circle is a degenerate point at the origin.

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

The tangent plane to a surface at a point p is the tangent space at p (after translating to the origin). The elements of the tangent space are called tangent vectors, and ...

In a given acute triangle DeltaABC, locate a point whose distances from A, B, and C have the smallest possible sum. The solution is the point from which each side subtends an ...

A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...