TOPICS
Search

Search Results for ""


741 - 750 of 3574 for Inverse FunctionsSearch Results
The Elsasser function is defined by the integral E(y,u)=int_(-1/2)^(1/2)exp[-(2piyusinh(2piy))/(cosh(2piy)-cos(2pix))]dx. (1) Special values include E(0,u) = 1 (2) E(y,0) = ...
To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...
The generalized Riemann hypothesis conjectures that neither the Riemann zeta function nor any Dirichlet L-series has a zero with real part larger than 1/2. Compare with ...
The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...
An analytic function f on the unit disk is called schlicht if 1. f is one-to-one, 2. f(0)=0, and 3. f^'(0)=1, in which case it is written f in S. Schlicht functions have ...
The m+1 ellipsoidal harmonics when kappa_1, kappa_2, and kappa_3 are given can be arranged in such a way that the rth function has r-1 zeros between -a^2 and -b^2 and the ...
The triangle coefficient is function of three variables written Delta(abc)=Delta(a,b,c) and defined by Delta(abc)=((a+b-c)!(a-b+c)!(-a+b+c)!)/((a+b+c+1)!), (Shore and Menzel ...
Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...
The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...
Euler's continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...
1 ... 72|73|74|75|76|77|78 ... 358 Previous Next

...