Search Results for ""
2111 - 2120 of 3378 for Riemann Series TheoremSearch Results
Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...
A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...
The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...
The operator representing the computation of a derivative, D^~=d/(dx), (1) sometimes also called the Newton-Leibniz operator. The second derivative is then denoted D^~^2, the ...
kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...
Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Also let R[z]>0 ...
Ellipsoidal harmonics of the second kind, also known as Lamé functions of the second kind, are variously defined as F_m^p(x)=(2m+1)E_m^p(x) ...
The E_n(x) function is defined by the integral E_n(x)=int_1^infty(e^(-xt)dt)/(t^n) (1) and is given by the Wolfram Language function ExpIntegralE[n, x]. Defining t=eta^(-1) ...
1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...
The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...
...
View search results from all Wolfram sites (31614 matches)

