Search Results for ""
21 - 30 of 8520 for Inline 1Search Results
The n×n square matrix F_n with entries given by F_(jk)=e^(2piijk/n)=omega^(jk) (1) for j,k=0, 1, 2, ..., n-1, where i is the imaginary number i=sqrt(-1), and normalized by ...
A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...
An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.
R_m(x,y) = (J_m^'(x)Y_m^'(y)-J_m^'(y)Y_m^'(x))/(J_m(x)Y_m^'(y)-J_m^'(y)Y_m(x)) (1) S_m(x,y) = (J_m^'(x)Y_m(y)-J_m(y)Y_m^'(x))/(J_m(x)Y_m(y)-J_m(y)Y_m(x)). (2)
For R[a+b-c-d]<-1 and a and b not integers,
The positions of the geometric centroid of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) are x^_ = ...
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
The map x^' = x+1 (1) y^' = 2x+y+1, (2) which leaves the parabola x^('2)-y^'=(x+1)^2-(2x+y+1)=x^2-y (3) invariant.
The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...
A biquadratic number is a fourth power, n^4. The first few biquadratic numbers are 1, 16, 81, 256, 625, ... (OEIS A000583). The minimum number of biquadratic numbers needed ...
...
View search results from all Wolfram sites (501409 matches)

