Search Results for ""

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Every finite group G of order greater than one possesses a finite series of subgroups, called a composition series, such that I<|H_s<|...<|H_2<|H_1<|G, where H_(i+1) is a ...

Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...

Two geometric figures are said to be concentric if their centers coincide. The region between two concentric circles is called an annulus. The following table summarizes some ...

A curve whose name means "shell form." Let C be a curve and O a fixed point. Let P and P^' be points on a line from O to C meeting it at Q, where P^'Q=QP=k, with k a given ...

The conchoid of de Sluze is the cubic curve first constructed by René de Sluze in 1662. It is given by the implicit equation (x-1)(x^2+y^2)=ax^2, (1) or the polar equation ...