Search Results for ""
1611 - 1620 of 9250 for Square Root Of Minus 2Search Results
Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...
For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.
A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...
The projective special unitary group PSU_n(q) is the group obtained from the special unitary group SU_n(q) on factoring by the scalar matrices contained in that group. ...
The path traced out by a fixed point at a radius b>a, where a is the radius of a rolling circle, also sometimes called an extended cycloid. The prolate cycloid contains ...
A polynomial given in terms of the Neumann polynomials O_n(x) by S_n(x)=(2xO_n(x)-2cos^2(1/2npi))/n.
Let l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...
(1) or (2) The solutions are Jacobi polynomials P_n^((alpha,beta))(x) or, in terms of hypergeometric functions, as y(x)=C_1_2F_1(-n,n+1+alpha+beta,1+alpha,1/2(x-1)) ...
A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...
The outer Napoleon circle, a term coined here for the first time, is the circumcircle of the outer Napoleon triangle. It has center at the triangle centroid G (and is thus ...
...
View search results from all Wolfram sites (491138 matches)

