Search Results for ""

The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.

One of the three 2-polyaboloes.

A metric g_(ij) which is zero for i!=j.

A cryptarithmetic in which digits are used to represent other digits.

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...

The operator D=-i(d+d^*), where d^* is the adjoint.

Let the divisor function d(n) be the number of divisors of n (including n itself). For a prime p, d(p)=2. In general, sum_(k=1)^nd(k)=nlnn+(2gamma-1)n+O(n^theta), where gamma ...

If g is continuous and mu,nu>0, then int_0^t(t-xi)^(mu-1)dxiint_0^xi(xi-x)^(nu-1)g(xi,x)dx =int_0^tdxint_x^t(t-xi)^(mu-1)(xi-x)^(nu-1)g(xi,x)dxi.

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.