Search Results for ""
941 - 950 of 3927 for Distribution Generalized FunctionSearch Results
sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...
Let f be a function defined on a set A and taking values in a set B. Then f is said to be a surjection (or surjective map) if, for any b in B, there exists an a in A for ...
If f is a continuous real-valued function on [a,b] and if any epsilon>0 is given, then there exists a polynomial p on [a,b] such that |f(x)-P(x)|<epsilon for all x in [a,b]. ...
Let phi(z)=cz+c_0+c_1z^(-1)+c_2z^(-2)+... be an analytic function, regular and univalent for |z|>1, that maps |z|>1 conformally onto the region T preserving the point at ...
The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...
The bei_nu(z) function is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...
A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...
Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...
The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...
The nontrivial zeros of the Riemann zeta function correspond to the eigenvalues of some Hermitian operator (Derbyshire 2004, pp. 277-278).
...
View search results from all Wolfram sites (425822 matches)

