Search Results for ""

A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...

Approximations to Khinchin's constant include K = -(ln85181832)/(tan8) (1) = 1/(29)sqrt(6065) (2) = 6-sqrt(ln59055) (3) = 18^(27/79), (4) which are correct to 9, 7, 6, and 5 ...

The inertial subranges of velocity power spectra for homogeneous turbulence exhibit a power law with exponent -5/3. This exponent (-5/3) is called the Kolmogorov constant by ...

Lagrange's continued fraction theorem, proved by Lagrange in 1770, states that any positive quadratic surd sqrt(a) has a regular continued fraction which is periodic after ...

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...

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

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

The inverse transform sum_(n=1)^infty(a_nx^n)/(n!)=ln(1+sum_(n=1)^infty(b_nx^n)/(n!)) of the exponential transform ...