Search Results for ""

The probability density function for Student's z-distribution is given by f_n(z)=(Gamma(n/2))/(sqrt(pi)Gamma((n-1)/2))(1+z^2)^(-n/2). (1) Now define ...

In the above figure, let DeltaABC be a right triangle, arcs AP and AQ be segments of circles centered at C and B respectively, and define a = BC (1) b = CA=CP (2) c = BA=BQ. ...

The Yiu A-circle of a reference triangle DeltaABC is the circle passing through vertex A and the reflections of vertices B and C with respect to the opposite sides. The Yiu ...

The q-analog of the factorial (by analogy with the q-gamma function). For k an integer, the q-factorial is defined by [k]_q! = faq(k,q) (1) = ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary k-multiperfect number is a number n such that sigma_infty(n)=kn. Cohen (1990) found 13 ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...