Search Results for ""
971 - 980 of 5387 for Inline 4Search Results
The following vector integrals are related to the curl theorem. If F=cxP(x,y,z), (1) then int_CdsxP=int_S(daxdel )xP. (2) If F=cF, (3) then int_CFds=int_Sdaxdel F. (4) The ...
The Werner formulas are the trigonometric product formulas 2sinalphacosbeta = sin(alpha-beta)+sin(alpha+beta) (1) 2cosalphacosbeta = cos(alpha-beta)+cos(alpha+beta) (2) ...
The Yff contact circle is the circumcircle of the Yff contact triangle. Its center has triangle center function alpha=((b-c)(3a^3+b^3+c^3-2a^2b-2a^2c-abc))/a, (1) which does ...
A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...
The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...
An infinite sequence of positive integers 1<=b_1<b_2<b_3<..., (1) also called a Sidon sequence, such that all pairwise sums b_i+b_j (2) for i<=j are distinct (Guy 1994). An ...
If f(z) is analytic in some simply connected region R, then ∮_gammaf(z)dz=0 (1) for any closed contour gamma completely contained in R. Writing z as z=x+iy (2) and f(z) as ...
An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...
Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...
Clausen's integral, sometimes called the log sine integral (Borwein and Bailey 2003, p. 88) is the n=2 case of the S_2 Clausen function Cl_2(theta) = ...
...
View search results from all Wolfram sites (337178 matches)

