Search Results for ""

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...

(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...

A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...

The Zolotarev-Schur constant is given by sigma = 1/(c^2)[1-(E(c))/(K(c))]^2 (1) = 0.3110788667048... (2) (OEIS A143295), where K(c) is a complete elliptic integral of the ...

The d-analog of a complex number s is defined as [s]_d=1-(2^d)/(s^d) (1) (Flajolet et al. 1995). For integer n, [2]!=1 and [n]_d! = [3][4]...[n] (2) = ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...

An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...

The q-analog of the factorial (by analogy with the q-gamma function). For k an integer, the q-factorial is defined by [k]_q! = faq(k,q) (1) = ...

The q-analog of pi pi_q can be defined by setting a=0 in the q-factorial [a]_q!=1(1+q)(1+q+q^2)...(1+q+...+q^(a-1)) (1) to obtain ...