Search Results for ""

The Weierstrass substitution is the trigonometric substitution t=tan(theta/2) which transforms an integral of the form intf(costheta,sintheta)dtheta into one of the form ...

The Weierstrass zeta function zeta(z;g_2,g_3) is the quasiperiodic function defined by (dzeta(z;g_2,g_3))/(dz)=-P(z;g_2,g_3), (1) where P(z;g_2,g_3) is the Weierstrass ...

Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...

Given a succession of nonsingular points which are on a nonhyperelliptic curve of curve genus p, but are not a group of the canonical series, the number of groups of the ...

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...

The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...