Search Results for ""
691 - 700 of 3564 for Incomplete Beta FunctionSearch Results
![](/common/images/search/spacer.gif)
An integral equation of the form phi(x)=f(x)+int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved ...
Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
Suppose alpha:C_*->D_* and beta:C_*->D_* are two chain homomorphisms. Then a chain homotopy is given by a sequence of maps delta_p:C_p->D_(p-1) such that partial_D ...
A tensor-like coefficient which gives the difference between partial derivatives of two coordinates with respect to the other coordinate, ...
Let alpha_(n+1) = (2alpha_nbeta_n)/(alpha_n+beta_n) (1) beta_(n+1) = sqrt(alpha_nbeta_n), (2) then H(alpha_0,beta_0)=lim_(n->infty)a_n=1/(M(alpha_0^(-1),beta_0^(-1))), (3) ...
Let (A,<=) and (B,<=) be well ordered sets with ordinal numbers alpha and beta. Then alpha<beta iff A is order isomorphic to an initial segment of B (Dauben 1990, p. 199). ...
J_n(x)=1/piint_0^picos(ntheta-xsintheta)dtheta, where J_n(x) is a Bessel function of the first kind.
If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.
If Y_i have normal independent distributions with mean 0 and variance 1, then chi^2=sum_(i=1)^rY_i^2 (1) is distributed as chi^2 with r degrees of freedom. This makes a chi^2 ...
![](/common/images/search/spacer.gif)
...