Search Results for ""

If a random variable X has a chi-squared distribution with m degrees of freedom (chi_m^2) and a random variable Y has a chi-squared distribution with n degrees of freedom ...

The Steiner triangle DeltaS_AS_BS_C (a term coined here for the first time), is the Cevian triangle of the Steiner point S. It is the polar triangle of the Kiepert parabola. ...

If p is a prime >3, then the numerator of the harmonic number H_(p-1)=1+1/2+1/3+...+1/(p-1) (1) is divisible by p^2 and the numerator of the generalized harmonic number ...

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