Search Results for ""

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

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

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

Approximates the possible values of y in terms of x if sum_(i,j=0)^na_(ij)x^iy^j=0.

Let a triangle have side lengths a, b, and c with opposite angles A, B, and C. Then (b+c)/a = (cos[1/2(B-C)])/(sin(1/2A)) (1) (c+a)/b = (cos[1/2(C-A)])/(sin(1/2B)) (2) ...

If each of two nonparallel transversals with nonminimal directions meets a given curve in finite points only, then the ratio of products of the distances from the two sets of ...