Search Results for ""

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The operating of shifting the leading digits of an addition into the next column to the left when the sum of that column exceeds a single digit (i.e., 9 in base 10).

A diagonal of a square matrix which is traversed in the "southeast" direction. "The" diagonal (or "main diagonal," or "principal diagonal," or "leading diagonal") of an n×n ...

A logarithmic singularity is a singularity of an analytic function whose main z-dependent term is of order O(lnz). An example is the singularity of the Bessel function of the ...

The areas of the regions illustrated above can be found from the equations A+4B+4C=1 (1) A+3B+2C=1/4pi. (2) Since we want to solve for three variables, we need a third ...

A spherical ring is a sphere with a cylindrical hole cut so that the centers of the cylinder and sphere coincide, also called a napkin ring. Let the sphere have radius R and ...

An alternative term for a binomial coefficient, in which (n; k) is read as "n choose k." R. K. Guy suggested this pronunciation around 1950, when the notations ^nC_r and ...

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...