Search Results for ""

A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...

In geometry, the term "enlargement" is a synonym for expansion. In nonstandard analysis, let X be a set of urelements, and let V(X) be the superstructure with individuals in ...

The Euler formula, sometimes also called the Euler identity (e.g., Trott 2004, p. 174), states e^(ix)=cosx+isinx, (1) where i is the imaginary unit. Note that Euler's ...

Define the sequence a_0=1, a_1=x, and a_n=(a_(n-2))/(1+a_(n-1)) (1) for n>=0. The first few values are a_2 = 1/(1+x) (2) a_3 = (x(1+x))/(2+x) (3) a_4 = ...

Solving the nome q for the parameter m gives m(q) = (theta_2^4(q))/(theta_3^4(q)) (1) = (16eta^8(1/2tau)eta^(16)(2tau))/(eta^(24)(tau)), (2) where theta_i(q)=theta_i(0,q) is ...

Modular arithmetic is the arithmetic of congruences, sometimes known informally as "clock arithmetic." In modular arithmetic, numbers "wrap around" upon reaching a given ...

A quotient-difference table is a triangular array of numbers constructed by drawing a sequence of n numbers in a horizontal row and placing a 1 above each. An additional "1" ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...