Search Results for ""
71 - 80 of 542 for Binary heapSearch Results
View search results from all Wolfram sites (4496 matches)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 ...
A word is said to be overlapfree if it has no subwords of the form xyxyx. A squarefree word is overlapfree, and an overlapfree word is cubefree. The numbers t(n) of binary ...
Rule 188 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 28 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 50 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
The logarithm of the reciprocal of a number, equal to the negative of the logarithm of the number itself, cologx=log(1/x)=-logx.
The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...
The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...
An area-preserving affine transformation. Equiaffinities include the crossed hyperbolic rotation, elliptic rotation, hyperbolic rotation, and parabolic rotation.
A graded algebra over the integers Z. Cohomology of a space is a graded ring.
...