Search Results for ""

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...

A map u:R^n->R^n from a domain G is called a map of class C^r if each component of u(x)=(u_1(x_1,...,x_n),...,u_m(x_1,...,x_n)) is of class C^r (0<=r<=infty or r=omega) in G, ...

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...

A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...

Let f:R->R, then the negative part of f is the function f^-:R->R defined by f^-(x)=max(-f(x),0). Note that the negative part is itself a nonnegative function. The negative ...

A nonpositive matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonpositive number, i.e., a_(ij)<=0 for all i, j. Nonpositive matrices are ...

In every residue class modulo p, there is exactly one integer polynomial with coefficients >=0 and <=p-1. This polynomial is called the normal polynomial modulo p in the ...

The partial differential equation (1+u_y^2)u_(xx)-2u_xu_yu_(xy)+(1+u_x^2)u_(yy)=0 (correcting a typo in Zwillinger 1997, p. 134).

The system of partial differential equations u_(xx)-u_(yy)+/-sinucosu+(cosu)/(sin^3u)(v_x^2-v_y^2)=0 (v_xcot^2u)_x=(v_ycot^2u)_y.

A tangent vector v_(p)=v_1x_u+v_2x_v is a principal vector iff det[v_2^2 -v_1v_2 v_1^2; E F G; e f g]=0, where e, f, and g are coefficients of the first fundamental form and ...