Search Results for ""

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...

The distribution for the sum X_1+X_2+...+X_n of n uniform variates on the interval [0,1] can be found directly as (1) where delta(x) is a delta function. A more elegant ...

The orthogonal polynomials on the interval [-1,1] associated with the weighting functions w(x) = (1-x^2)^(-1/2) (1) w(x) = (1-x^2)^(1/2) (2) w(x) = sqrt((1-x)/(1+x)), (3) ...

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

A random number generator produced by iterating X_(n+1)=|100lnX_n (mod 1)| for a seed X_0=0.1. This simple generator passes the noise sphere test for randomness by showing no ...

Let gamma(t) be a smooth curve in a manifold M from x to y with gamma(0)=x and gamma(1)=y. Then gamma^'(t) in T_(gamma(t)), where T_x is the tangent space of M at x. The ...

The heptanacci constant is the limiting ratio of adjacent heptanacci numbers. It is the algebraic number P = (x^7-x^6-x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.99196419660... (2) (OEIS ...

The sequence defined by H(0)=0 and H(n)=n-H(H(H(n-1))). The first few terms are 1, 1, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 10, 10, 11, 12, 13, 13, 14, ... (OEIS A005374).