Search Results for ""

The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...

The kurtosis excess of a distribution is sometimes called the excess, or excess coefficient. In graph theory, excess refers to the quantity e=n-n_l(v,g) (1) for a v-regular ...

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

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

The q-analog of the derivative, defined by (d/(dx))_qf(x)=(f(x)-f(qx))/(x-qx). (1) For example, (d/(dx))_qsinx = (sinx-sin(qx))/(x-qx) (2) (d/(dx))_qlnx = ...

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

Given a regular surface M, an asymptotic curve is formally defined as a curve x(t) on M such that the normal curvature is 0 in the direction x^'(t) for all t in the domain of ...