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

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

Let K be a field of field characteristic 0 (e.g., the rationals Q) and let {u_n} be a sequence of elements of K which satisfies a difference equation of the form ...

Polynomials s_n(x) which form the Sheffer sequence for f^(-1)(t)=1+t-e^t, (1) where f^(-1)(t) is the inverse function of f(t), and have generating function ...

An n-cycle is a finite sequence of points Y_0, ..., Y_(n-1) such that, under a map G, Y_1 = G(Y_0) (1) Y_2 = G(Y_1) (2) Y_(n-1) = G(Y_(n-2)) (3) Y_0 = G(Y_(n-1)). (4) In ...

A spectrum containing the real numbers larger than Freiman's constant.

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...