Search Results for ""

An odious number is a nonnegative number that has an odd number of 1s in its binary expansion. The first few odious numbers are therefore 1, 2, 4, 7, 8, 11, 13, 14, 16, 19, ...

Several flavors of the open mapping theorem state: 1. A continuous surjective linear mapping between Banach spaces is an open map. 2. A nonconstant analytic function on a ...

If (1-z)^(alpha+beta-gamma-1/2)_2F_1(2alpha,2beta;2gamma;z)=sum_(n=0)^inftya_nz^n, (1) where _2F_1(a,b;c;z) is a hypergeometric function, then (2) where (a)_n is a Pochhammer ...

An orthogonal transformation is a linear transformation T:V->V which preserves a symmetric inner product. In particular, an orthogonal transformation (technically, an ...

Given any set B, the associated pair groupoid is the set B×B with the maps alpha(a,b)=a and beta(a,b)=b, and multiplication (a,b)·(b,c)=(a,c). The inverse is ...

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...

According to G. Pólya, the method of finding geometric objects by intersection. 1. For example, the centers of all circles tangent to a straight line s at a given point P lie ...

A point group is a group of symmetry operations which all leave at least one point unmoved. Although an isolated object may have an arbitrary Schönflies symbol, the ...

A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...

A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...