Search Results for ""

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

Random walk trajectories which are composed of self-similar jumps. They are described by the Lévy distribution.

A Lie groupoid over B is a groupoid G for which G and B are differentiable manifolds and alpha,beta and multiplication are differentiable maps. Furthermore, the derivatives ...

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

A planar diagram depicting a link (or knot) as a sequence of segments with gaps representing undercrossings and solid lines overcrossings. In such a diagram, only two ...

A link invariant is a function from the set of all links to any other set such that the function does not change as the link is changed (up to isotopy). In other words, a ...

The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...

The sequence composed of 1s and 2s obtained by starting with the number 1, and picking subsequent elements to avoid repeating the longest possible substring. The first few ...