Search Results for ""

If {f_n} is a sequence of measurable functions, with 0<=f_n<=f_(n+1) for every n, then intlim_(n->infty)f_ndmu=lim_(n->infty)intf_ndmu.

For s_1,s_2=+/-1, lim_(epsilon_1->0; epsilon_2->0)1/(x_1-is_1epsilon_1)1/(x_2-is_2epsilon_2) =[PV(1/(x_1))+ipis_1delta(x_1)][PV(1/(x_2))+ipis_2delta(x_2)] ...

Theta(G;A)=<theta(a):a in A-1> is an A-invariant solvable p^'-subgroup of G.

If (sinalpha)/(sinbeta)=m/n, then (tan[1/2(alpha-beta)])/(tan[1/2(alpha+beta)])=(m-n)/(m+n).

The sum of the values of an integral of the "first" or "second" sort int_(x_0,y_0)^(x_1,y_1)(Pdx)/Q+...+int_(x_0,y_0)^(x_N,y_N)(Pdx)/Q=F(z) and ...

A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...

Let M be the midpoint of the arc AMB. Pick C at random and pick D such that MD_|_AC (where _|_ denotes perpendicular). Then AD=DC+BC.

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

Every continuous map f:S^n->R^n must identify a pair of antipodal points.