Search Results for ""

The regular decagon is constructible 10-sided regular polygon with Schläfli symbol {10}. The inradius r, circumradius R, and area can be computed directly from the formulas ...

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...

The trace of a second-tensor rank tensor T is a scalar given by the contracted mixed tensor equal to T_i^i. The trace satisfies ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

Sociable numbers computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...