Search Results for ""

Let P be the principal (initial investment), r be the annual compounded rate, i^((n)) the "nominal rate," n be the number of times interest is compounded per year (i.e., the ...

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 ...

The cototient of a positive number n is defined as n-phi(n), where n is the totient function. It is therefore the number of positive integers <=n that have at least one prime ...

Let a knot K be parameterized by a vector function v(t) with t in S^1, and let w be a fixed unit vector in R^3. Count the number of local minima of the projection function ...

A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...

A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

A symbol used to distinguish a third quantity x^('') ("x double prime") from two other related quantities x and x^' ("x prime). Double primes are most commonly used to denote ...

Gödel's first incompleteness theorem states that all consistent axiomatic formulations of number theory which include Peano arithmetic include undecidable propositions ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...