Search Results for ""
1211 - 1220 of 3983 for Log Gamma FunctionSearch Results
A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...
Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...
A statistical distribution for which the variables may take on a continuous range of values. Abramowitz and Stegun (1972, p. 930) give a table of the parameters of most ...
For any sequence of integers 0<n_1<...<n_k, there is a flag manifold of type (n_1, ..., n_k) which is the collection of ordered sets of vector subspaces of R^(n_k) (V_1, ..., ...
An equilibrium point in game theory is a set of strategies {x^^_1,...,x^^_n} such that the ith payoff function K_i(x) is larger or equal for any other ith strategy, i.e., ...
A moment sequence is a sequence {mu_n}_(n=0)^infty defined for n=0, 1, ... by mu_n=int_0^1t^ndalpha(t), where alpha(t) is a function of bounded variation in the interval ...
Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...
A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...
The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...
The invariants of a Weierstrass elliptic function P(z|omega_1,omega_2) are defined by the Eisenstein series g_2(omega_1,omega_2) = 60sum^'_(m,n)Omega_(mn)^(-4) (1) ...
...
View search results from all Wolfram sites (424754 matches)

