Search Results for ""

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

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

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

A base-b BBP-type formula is a convergent series formula of the type alpha=sum_(k=0)^infty(p(k))/(b^kq(k)) (1) where p(k) and q(k) are integer polynomials in k (Bailey 2000; ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...