Search Results for ""
811 - 820 of 1364 for Pi DigitsSearch Results
The percentage error is 100% times the relative error.
int_0^z(t^mu)/(1+t)dt=z/(mu+1+((mu+1)^2z)/((mu+2)-(mu+1)z+((mu+2)^2z)/((mu+3)-(mu+2)z+...))) for mu>-1 and -1<z<=1 (Perron 1954-1957, p. 18; Borwein et al. 2004, p. 35).
An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...
The 4-polyhex illustrated above.
Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...
The Poincaré group is another name for the inhomogeneous Lorentz group (Weinberg 1972, p. 28) and corresponds to the group of inhomogeneous Lorentz transformations, also ...
D_P(x)=lim_(epsilon->0)(lnmu(B_epsilon(x)))/(lnepsilon), where B_epsilon(x) is an n-dimensional ball of radius epsilon centered at x and mu is the probability measure.
Let c=(c_1,...,c_n) be a point in C^n, then the open polydisk is defined by S={z:|z_j-c_j|<|z_j^0-c_j|} for j=1, ..., n.
A premise is a statement that is assumed to be true. Formal logic uses a set of premises and syllogisms to arrive at a conclusion.
Given algebraic numbers a_1, ..., a_n it is always possible to find a single algebraic number b such that each of a_1, ..., a_n can be expressed as a polynomial in b with ...
...
View search results from all Wolfram sites (264593 matches)

