Search Results for ""
1141 - 1150 of 1780 for Prime FactorSearch Results
Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...
A shuffling algorithm used in a class of random number generators.
For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...
Given two bicentric points P=p:q:r and U=u:v:w, their bicentric sum is defined by p+u:q+v:r:w.
The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...
Each of the maps in a chain complex ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... is known as a boundary operator.
When n is an integer >=0, then J_n(z) and J_(n+m)(z) have no common zeros other than at z=0 for m an integer >=1, where J_n(z) is a Bessel function of the first kind. The ...
Let where (alpha)_j is a Pochhammer symbol, and let alpha be a negative integer. Then S(alpha,beta,m;z)=(Gamma(beta+1-m))/(Gamma(alpha+beta+1-m)), where Gamma(z) is the gamma ...
Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.
Cahen's constant is defined as C = sum_(k=0)^(infty)((-1)^k)/(a_k-1) (1) = 0.64341054628... (2) (OEIS A118227), where a_k is the kth term of Sylvester's sequence.
...
View search results from all Wolfram sites (10835 matches)

