Search Results for ""

If, for n>=0, beta_n=sum_(r=0)^n(alpha_r)/((q;q)_(n-r)(aq;q)_(n+r)), (1) then beta_n^'=sum_(r=0)^n(alpha_r^')/((q;q)_(n-r)(aq;q)_(n+r)), (2) where alpha_r^' = ...

A basis for the real numbers R, considered as a vector space over the rationals Q, i.e., a set of real numbers {U_alpha} such that every real number beta has a unique ...

A Liouville number is a transcendental number which has very close rational number approximations. An irrational number beta is called a Liouville number if, for each n, ...

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

A linear functional defined on a subspace of a vector space V and which is dominated by a sublinear function defined on V has a linear extension which is also dominated by ...

An integral equation of the form 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 for.

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 ...