Search Results for ""

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...

Let n>=0 and alpha_1, alpha_2, ...be the positive roots of J_n(x)=0, where J_n(z) is a Bessel function of the first kind. An expansion of a function in the interval (0,1) in ...

The r-Hofstadter triangle of a given triangle DeltaABC is perspective to DeltaABC, and the perspector is called the Hofstadter point. The triangle center function is ...

The Radon-Nikodym theorem asserts that any absolutely continuous complex measure lambda with respect to some positive measure mu (which could be Lebesgue measure or Haar ...

The nth Ramanujan prime is the smallest number R_n such that pi(x)-pi(x/2)>=n for all x>=R_n, where pi(x) is the prime counting function. In other words, there are at least n ...

Let phi(n) be any function, say analytic or integrable. Then int_0^inftyx^(s-1)sum_(k=0)^infty(-1)^kx^kphi(k)dx=(piphi(-s))/(sin(spi)) (1) and ...

Suppose f(x) is a function of x that is twice differentiable at a stationary point x_0. 1. If f^('')(x_0)>0, then f has a local minimum at x_0. 2. If f^('')(x_0)<0, then f ...

Let f be a real-valued, continuous, and strictly increasing function on [0,c] with c>0. If f(0)=0, a in [0,c], and b in [0,f(c)], then int_0^af(x)dx+int_0^bf^(-1)(x)dx>=ab, ...

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...